Find a string in Python – HackerRank Solution

Find a string in Python - HackerRank Solution
Find a string in Python – HackerRank Solution

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)<= 200Each 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.


Sample Input :

ABCDCDC
CDC

Sample Output :

2

Concept :

Some string processing examples, such as these, might be useful.
There are a couple of new concepts:
In Python, the length of a string is found by the function len(s), where  is the string.

To traverse through the length of a string, use a for loop:

for i in range(0, len(s)):
    print (s[i])

A range function is used to loop over some length:

range (0, 5)

Here, the range loops over 0to 4. 5 is excluded.

Find a string in Python – HackerRank Solution

def count_substring(string, sub_string):
    # Find a string in Python - Hacker Rank Solution START
    count = 0
    for i in range(len(string)-len(sub_string)+1):
        if (string[i:i+len(sub_string)] == sub_string):
            count += 1
    return count
    # Find a string in Python - HackerRank Solution END
if __name__ == '__main__':
    string = raw_input().strip()
    sub_string = raw_input().strip()
    count = count_substring(string, sub_string)
    print count

Disclaimer: The above Problem (Find a string in Python – HackerRank Solution) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.

Leave a Comment