forked from prakash079/Hackerrank_python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfind_a_string.py
More file actions
34 lines (23 loc) · 1 KB
/
find_a_string.py
File metadata and controls
34 lines (23 loc) · 1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# Find a string
# In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs in the given
# string. String traversal will take place from left to right, not from right to left.
# NOTE: String letters are case-sensitive.
# Input Format
# The first line of input contains the original string. The next line contains the substring.
# Constraints
# 1 <= len(string) <= 200
# Each character in the string is an ascii character.
# Output Format
# Output the integer number indicating the total number of occurrences of the substring in the original string.
----------------------------------------------------------------------
def count_substring(string, sub_string):
c=0
for i in range(0,len(string)):
if string[i:i+len(sub_string)] == sub_string:
c += 1
return c
if __name__ == '__main__':
string = input().strip()
sub_string = input().strip()
count = count_substring(string, sub_string)
print(count)