#Timothy

def areAnagrams(s,t):
    
    """ s and t are strings
        
    return True if s and t are anagrams, case INSENSITIVE
        
    areAnagrams('space', 'Capes') -> True
        
    areAnagrams('spatter', 'parsers') -> False
        
    areAngrams('dog', 'log') -> False"""
    
    s = s.lower()
    
    t = t.lower()
    
    if len(s) == len(t):
        
        for i in range(len(s)):
            
        if t.find(s[i]) == -1:
                
        return False
            
        t.replace(s[i],"",1)
        
        return True
    
    return False
  

#Rujula


def weaveStrings(s,t):
    
    
    if len(s)<=len(t):
        
        shorter=s
        
        longer=t
    
    else:
        
        shorter=t
        
        longer=s

    
        final=""
    
    counter=0

    
    for x in shorter:
        
        final+=s[counter]
        
        final+=t[counter]
        
        counter+=1

    
        final+=longer[counter:len(longer)]
    
    return final


From James Li to Everyone: (10:29 AM)
# James
def areAnagrams(s,t):
    """ s and t are strings
        return True if s and t are anagrams, case INSENSITIVE
        areAnagrams('space', 'Capes') -> True
        areAnagrams('spatter', 'parsers') -> False
        areAngrams('dog', 'log') -> False"""
    if (type(s) != type(t)) or type(s) != type(""):
        return False
    if len(s) != len(t):
        return False
    s = s.lower()
    t = t.lower()
    for x in range(len(s)):
        pattern = s[x]
        if len(re.findall(pattern, t)) != len(re.findall(pattern, s)):
            return False
    return True


From Mireya De Los Reyes to Everyone: (10:29 AM)
def countWords(s):
    word_count = 0
    if s:
        word_count += 1
    for i in s:
        if i == " ":
            word_count += 1
    return(word_count)


From Rujula Yete to Everyone: (10:30 AM)
#Rujula
def areAnagrams(s,t):
    """ s and t are strings
        return True if s and t are anagrams, case INSENSITIVE
        areAnagrams('space', 'Capes') -> True
        areAnagrams('spatter', 'parsers') -> False
        areAngrams('dog', 'log') -> False"""

    s=s.lower()
    t=t.lower()

    if len(s)!=len(t):
        return False

    for x in s:
        if x not in t:
            return False
    return True


From Timothy Deng to Everyone: (10:31 AM)
#Timothy
def containsEmbeddedWord(word, searchField):
    """
    word is a string of letters 
    searchField is a string
    returns True if the letters in word can be found in 
    order in the string searchField.  This is case-insensitive
    containsEmbeddedWord("abcd, "abcessed") -> True
    containsEmbeddedWord("foot, "flounder of trust") -> True
    containsEmbeddedWord("dequeue", "defend the queen") -> False"""
    word = word.lower()
    searchField = searchField.lower()
    for i in range(len(word)):
        if searchField.find(word[i]) == -1:
            return False
        searchField = searchField[searchField.find(word[i]):]
    return True
    pass