# coding: utf-8
def examineOccurrence(s , occ):
    # obtenir la longueur de l'occurrence occ et la longueur de la chaîne s 
    m = len(occ)
    n = len(s)

    # initialize counter 
    counter = 0
    
    # recherche de l'occurrence dans la chaîne s
    for i in range(0 , n-m):
        if s[i : m + i] == occ:
            counter = counter + 1
    if counter > 0:
        return True
    else:
        return False

# Exemple:
s = "Python is the most popular programming language"
occ1 = "most"
occ2 = "algorithm"
print(examineOccurrence(s, occ1)) # affiche: True
print(examineOccurrence(s, occ2)) # affiche: False