Find a string

Sort by

recency

|

3470 Discussions

|

  • + 0 comments

    Here's a soultion using .startswith() method

    • def count_substring(string, sub_string):
    • if len(string) in range(1, 201):
    • counter = sum(1 for i in range(len(string)) if string.startswith(sub_string, i))
    • return counter
  • + 0 comments

    made it a recursion for giggles

    def count_substring(string, sub_string): index = string.find(sub_string if index == -1: return 0 else: return 1 + count_substring(string[index+1:], sub_string)

  • + 0 comments

    Python 3 solution

    def count_substring(string, sub_string):
        count_sub_string = len(sub_string)
        count = 0
        for s in range(len(string)):
            x = string[s: s + count_sub_string]
            if (x == sub_string):
                count = count + 1
        return count
    
  • + 1 comment

    Likely not how the problem was meant to be solved, but you can also use regex lookarounds:

    import re
    
    def count_substring(string, sub_string):
        pattern = fr"(?={re.escape(sub_string)})"
        return len(re.findall(pattern, string))``
    
  • + 0 comments
    def count_substring(string, sub_string):
        count = 0
        for i in range(len(string)):
            if string[i:i + len(sub_string)] == sub_string:
                count += 1
        return count