Find a string

Sort by

recency

|

3444 Discussions

|

  • + 0 comments

    def count_substring(string, sub_string): count1 = 0 count2 = 0 i=0 j=0

    while(j<=len(string)-1):
        if string[j] == sub_string[i]:
            count1 += 1
            if count1 == len(sub_string):
                count2 += 1
                count1 = 0
                i = 0
                continue
            else:
                i+=1
                j+=1
                continue
        count1 = 0
        i = 0
        j += 1
    
    
    
    return count2
    

    if name == 'main': string = input().strip() sub_string = input().strip()

    count = count_substring(string, sub_string)
    print(count)
    
  • + 0 comments

    Just to point out, there is a slight optimization in the loop. One can stop after len(s) - len(sub) + 1 since the remaining part of s at that point is shorter than the pattern to match and thus can't possibly match.

  • + 0 comments

    damn i couldve just sliced it 😭 need more practice...

    def count_substring(string, sub_string):
        count = 0
        for i in range(len(string)):
            str = ""
            for j in range(len(sub_string)):
                if i<len(string):
                    str += string[i]
                    i += 1
            if str == sub_string:
                count += 1
                
        return count
    
  • + 0 comments
    def count_substring(string, sub_string):
        count = 0
        for i in range (len(string)):
             if string[i:].startswith(sub_string):
                count+=1
            
        return count
    
  • + 0 comments
    def count_substring(string, sub_string):
        n=0``
        for i in range(len(string)):
            if string[0:len(sub_string)]== sub_string:
                n+=1
            string = string[1:]       
        return n