HackerRank Find a string problem solution in python

In this HackerRAnk find a string problem solution in python we need to develop a python program that can take a string and substring as input and then we need to find that how many times substring occurs in that string.

Problem solution in Python 2 programming.

a,b=(raw_input() for i in range(2))
cnt=0
for i in range(len(a)-len(b)+1):
	if a[i:i+len(b)]==b:
		cnt+=1
print cnt

Problem solution in Python 3 programming.

def count_substring(string, sub_string):
    count = 0
    for i in range(0, len(string)-len(sub_string)+1):
        l = i
        for j in range(0, len(sub_string)):
            if string[l] == sub_string[j]:
                l +=1
                if j == len(sub_string)-1:
                    count = count + 1
                else:
                    continue
            else:
                break
            
    return count

Problem solution in pypy programming.

# Enter your code here. Read input from STDIN. Print output to STDOUT
s=raw_input()
d=len(s)
ss=raw_input()
dd=len(ss)
c=0

for i in range(d-dd+1):

    if s[i:i+dd] == ss:
        c+=1
print c

Problem solution in pypy3 programming.

#def count_substrings(string, sub_string):
string=str(input())
sub_string=str(input())
#print(string)
#print(sub_string)
count=0
for i in range(0,len(string)):
    str_i=string[i:i+len(sub_string)]
    #print(str_i)    
    if str_i ==sub_string:
        count=count+1
print(count)
#return