curriculum/challenges/english/blocks/daily-coding-challenges-python/68cae5b538ff798bbd4da003.md
Given two strings, determine how many times the second string appears in the first.
"aaa" contains "aa" twice. The first two a's and the second two.count('abcdefg', 'def') should return 1.
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(count('abcdefg', 'def'), 1)`)
}})
count('hello', 'world') should return 0.
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(count('hello', 'world'), 0)`)
}})
count('mississippi', 'iss') should return 2.
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(count('mississippi', 'iss'), 2)`)
}})
count('she sells seashells by the seashore', 'sh') should return 3.
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(count('she sells seashells by the seashore', 'sh'), 3)`)
}})
count('101010101010101010101', '101') should return 10.
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(count('101010101010101010101', '101'), 10)`)
}})
def count(text, parameter):
return text
def count(text, pattern):
if not pattern:
return 0
occurrences = 0
for i in range(len(text) - len(pattern) + 1):
if text[i:i+len(pattern)] == pattern:
occurrences += 1
return occurrences