From Mike Wang to Everyone: (12:39 PM)
Question: What days and what class number are for in-person classes? I've been looking around canvas and your home page, but I couldn't find the schedule.
From Me to Everyone: (12:41 PM)
MTR : in person
WF remote
From Pranet Sharma to Everyone: (12:44 PM)
$Pranet
def isPerfectNumber(n):
  return sumOfProperDivisors(n) == n

def sumOfProperDivisors(n):
  nl = []
  start = n//2
  for i in range(start, 0, -1):
    if n%i == 0:
      nl.append(i)
  return(sum(nl))
From Paul Warner to Everyone: (12:44 PM)
def isPerfectNumber(n):
    proper_divisors = []
    for i in range(1, n):
        if not n%i:
            proper_divisors.append(i)
    return sum(proper_divisors) == n
From Luke Pollard to Everyone: (12:44 PM)
#Luke
def countWords(s):
    return len(s.split())
From Krish Singhvi to Everyone: (12:45 PM)
#KrishS
From Sophia Benjamin to Everyone: (12:45 PM)
def areAnagrams(s,t): #Sophia
    if(not(len(s) == len(t))):
        return False
    for i in s:
        found = False
        for j in range(len(t)):
            if (i == t[j]) or (i.swapcase() == t[j]):
                t = t[:j] + t[j+1:]
                found = True
                break
        if(not(found)):
            return False
    return True
From Dhruv Ranganath to Everyone: (12:45 PM)
def weaveStrings(s,t):
    longest = s if len(s) > len(t) else t
    shortest = s if longest == t else t
    return ''.join([f'{s[i]}{t[i]}' if i < len(shortest) else s[i] for i in range(len(longest))])
#Dhruv
From Pranet Sharma to Everyone: (12:45 PM)
#Pranet
From Pranet Sharma to Everyone: (12:45 PM)
def areAnagrams(s, t):
  init = 0
  s.lower()
  t.lower()
  s = list(s)
  t = list(t)
  if len(s) != len(t):
    return False
  length = math.factorial(len(s))
  for i in range(length):
     random.shuffle(s)
     if s == t:
      init += 1
      return True
  if init != 1:
    return False
From Luke Pollard to Everyone: (12:45 PM)
def checkFileForWord(fileName, word):
    with open(fileName, "r") as fp:
        for line in fp:
            if word in line:
                return True
        return False
From Paul Warner to Everyone: (12:45 PM)
I forgot my name.
# Paul Warner
def isPerfectNumber(n):
    proper_divisors = []
    for i in range(1, n):
        if not n%i:
            proper_divisors.append(i)
    return sum(proper_divisors) == n
From Pranet Sharma to Everyone: (12:45 PM)
#Pranet
From Pranet Sharma to Everyone: (12:45 PM)
def weaveStrings(s,t):
  nl = []
  for i in s:
    nl.append(i)
    for k in t:
      nl.append(k)
      t = t[1:]
      print(k)
      break
  return ''.join(nl)
From Adam Fawcett to Everyone: (12:45 PM)
#Adamdef weaveStrings(s,t):
    helpme=0
    myweave=""
    if s.len() > t.len():
        helpme=s.len()
    else:
        helpme=t.len()
    for i in range (0, helpme):
         if s.len()> helpme:
            weave+=s[i]
         if t.len()> helpme:
            weave+=t[i]
    return weave
From Carl Pittenger to Everyone: (12:45 PM)
#Carl
def weaveStrings(s,t):
    if len(t) > len(s):
        s, t = t, s
    length = len(t)
    return ''.join(s[i] + t[i] for i in range(length)) + s[length:]
From Sophia Benjamin to Everyone: (12:46 PM)
def containsEmbeddedWord(word, searchField):
#Sophia
    j = 0
    for i in searchField:
        if (word[j] == i) or (word[j].swapcase() == i):
            j += 1
            if j == len(word):
                return True
    return False
From Paul Warner to Everyone: (12:46 PM)
# Paul Warner
def areAnagrams(s,t):
    s = list(s.lower())
    t = list(t.lower())
    for char in s:
        if char in t:
            t.remove(char)
    return not t
From Krish Singhvi to Everyone: (12:46 PM)
#Krish S a = "I eat cake"
b = ""
c = "0"
d = "To be or not to be, that is the question."
def countWords(s):
    NumA = len(s.split())
    print(NumA)


        
countWords(a)
countWords(b)  
countWords(c)  
countWords(d)
From Adam Fawcett to Everyone: (12:46 PM)
#Adam
def weaveStrings(s,t):
    helpme=0
    myweave=""
    if s.len() > t.len():
        helpme=s.len()
    else:
        helpme=t.len()
    for i in range (0, helpme):
         if s.len()> helpme:
            weave+=s[i]
         if t.len()> helpme:
            weave+=t[i]
    return weave
    
 def countWords(s):
    shatter=s.split
    return shatter.len()
From Pranet Sharma to Everyone: (12:47 PM)
Adam I love your variable names
From Luke Pollard to Everyone: (12:47 PM)
#Luke
def areAnagrams(s,t):
    s_list = list(s.lower())
    t_list = list(t.lower())
    s_list.sort()
    t_list.sort()
    if s_list == t_list:
        return True
    else:
        return False
From Carl Pittenger to Everyone: (12:47 PM)
#Carl
def checkFileForWord(fileName, word):
    if fileName.exists:
        with open(fileName) as f:
            return word in f.read()
    return False
From Luke Pollard to Everyone: (12:48 PM)
#Luke
def sumOfProperDivisors(n):
    divisors_sum = 0
    for i in range(1, n//2+1):
        if n % i == 0:
            divisors_sum += i
    return divisors_sum
def isPerfectNumber(n):
     if sumOfProperDivisors(n) == n:
        return True
    else:
        return False
From Baeden Vester to Everyone: (12:50 PM)
#Baeden Vester
From Baeden Vester to Everyone: (12:50 PM)
for char in s.lower():
        if char not in t.lower():
            return False

    return True
From Jimin Yu to Everyone: (12:50 PM)
return (sorted(s) == sorted(t))
From Chloe Monson to Everyone: (12:50 PM)
#Chloe
def countWords(s):
    return len(s.split())
From Luke Pollard to Everyone: (12:50 PM)
#Luke
def containsEmbeddedWord(word, searchField):
    for l in searchField:
        if word == "":
            return True
        if l == word[0]:
            word = word[1:]
    if word == "":
        return True
    else:
        return False
From Paul Warner to Everyone: (12:50 PM)
# Paul Warner
# fixed bug
def areAnagrams(s,t):
    s = list(s.lower())
    t = list(t.lower())
    for char in s:
        try:
            t.remove(char)
        except ValueError:
            return False
    return not t
From Sophia Benjamin to Everyone: (12:51 PM)
def areAnagrams(s,t): #Sophia
    if(not(len(s) == len(t))):
        return False
    for i in s:
        found = False
        for j in range(len(t)):
            if (i == t[j]) or (i.swapcase() == t[j]):
                t = t[:j] + t[j+1:]
                found = True
                break
        if(not(found)):
            return False
    return True
From Carl Pittenger to Everyone: (12:51 PM)
#Carl
def areAnagrams(s,t):
    s, t = s.lower(), t.lower()
    if len(s) == len(t):
        for i in range(len(s)):
            if s.count(s[i]) != s.count(t[i]):
                return False
        return True
    return False
From Baeden Vester to Everyone: (12:51 PM)
def areAnagrams(s,t):
    if len(s) == len(t):
        for char in s.lower():
            if char not in t.lower():
                return False

        return True
    else:
        return False
^#Baeden
From Dhruv Ranganath to Everyone: (12:52 PM)
#Dhruv
def areAnagrams(s, t):
    if len(s) != len(t):
        return False
    return all([True if letter in t.lower() else False for letter in s.lower()])
From Leonardo Atalla to Everyone: (12:52 PM)
#Leo
def containsEmbeddedWord(word, searchField):
    for char in searchField:
        if char in word:
            word = word.replace(char, '', 1)
        if len(word) == 0:
            return True
    return False
From Jimin Yu to Everyone: (12:56 PM)
#jimin yu
def areAnagrams(s,t):
    return (sorted(s) == sorted(t))
From Pranet Sharma to Everyone: (12:58 PM)
THAT'S THE BEST SOLUTION
From Carl Pittenger to Everyone: (12:58 PM)
^
From Pranet Sharma to Everyone: (12:58 PM)
just add a .lower() after s and t and it's perfect
From Carl Pittenger to Everyone: (12:58 PM)
yea
From Sophia Benjamin to Everyone: (12:59 PM)
Wait so sorted works on strings too? (I thought it was only lists but ig im wrong lol)
From Carl Pittenger to Everyone: (12:59 PM)
yea
From Pranet Sharma to Everyone: (12:59 PM)
sorted works on strings, sort only works on list
From Carl Pittenger to Everyone: (12:59 PM)
it works on any iterable
From Pranet Sharma to Everyone: (12:59 PM)
*lists
^^
From Sophia Benjamin to Everyone: (12:59 PM)
Oh ok ya makes sense
From Dhruv Ranganath to Everyone: (1:02 PM)
#Dhruv
def areAnagrams(s, t):
        areAnagrams('space', 'Capes') -> True
        areAnagrams('spatter', 'parsers') -> False
        areAnagrams('dog', 'log') -> False"""
    if len(s) != len(t):
        return False
    return ''.join(sorted(list(s.lower()))) == ''.join(sorted(list(t.lower())))
From Leonardo Atalla to Everyone: (1:03 PM)
#Leo
def weaveStrings(first,second):
    res = ""
    if len(first) < len(second):
        second,first = first,second
    for i in range(len(first)):
        res+=first[i]
        if i < len(second):
            res+=second[i]
    return res
From Leonardo Atalla to Everyone: (1:03 PM)
#Leo
def containsEmbeddedWord(word, searchField):
    for char in searchField:
        if char in word:
            word = word.replace(char, '', 1)
        if len(word) == 0:
            return True
    return False
From Jimin Yu to Everyone: (1:04 PM)
def areAnagrams(s,t):
    return (sorted(s.lower()) == sorted(t.lower()))
there we go
From Pranet Sharma to Everyone: (1:04 PM)
Yessir
From Jimin Yu to Everyone: (1:07 PM)
import re
def containsEmbeddedWord(word, searchField):
    letters = list(word)
    regex = '.*'.join(map(re.escape, letters))
    return re.search(regex, searchField) is not None
From Carl Pittenger to Everyone: (1:07 PM)
#Carl Modified
def weaveStrings(s,t):
    s, t, n = s.lower(), t.lower(), min(len(s), len(t))
    return ''.join(s[i] + t[i] for i in range(n)) + s[n:] + t[n:]
From Chloe Monson to Everyone: (1:12 PM)
#Chloe
def weaveStrings(s,t):
    sList = list(s)
    print(sList)
    tList = list(t)
    print(tList)
    weaveList = []
    counter = 0
    while counter < len(s):
        weaveList.append(s[counter])
        weaveList.append(t[counter])
        counter += 1
    finalString = ""
    for char in weaveList:
        finalString += char
    return finalString
Wait sorry just a sec
From Chloe Monson to Everyone: (1:12 PM)
#Chloe
def weaveStrings(s,t):
    sList = list(s)
    tList = list(t)
    weaveList = []
    counter = 0
    while counter < len(s):
        weaveList.append(s[counter])
        weaveList.append(t[counter])
        counter += 1
    finalString = ""
    for char in weaveList:
        finalString += char
    return finalString
From Baeden Vester to Everyone: (1:14 PM)
#Baeden Vester
def areAnagrams(s,t):
    if len(s) == len(t):
        for char in s.lower():
            if char not in t.lower():
                return False

        return True
    else:
        return False
From Chloe Monson to Everyone: (1:15 PM)
Mine only works if they are the same length

#Singhvi22k

a = "I eat cake"
b = ""
c = "0"
d = "To be or not to be, that is the question."
def countWords(s):
    NumA = len(s.split())
    print(NumA)


        
countWords(a)
countWords(b)  
countWords(c)  
countWords(d)

#Carl
def isPerfectNumber(n):
    def sum_of_proper_divisors(n):
        a = [i for i in range(2, int(n ** 0.5) + 1) if n % i == 0]
        a += [n // i for i in a if n // i not in a]
        return sum(a) + 1
    return n == sum_of_proper_divisors(n)

#Chloe
def areAnagrams(s,t):
    s = s.lower()
    t = t.lower()
    if len(s) != len(t):
        return False
    else:
        truths = []
        for char in s:
            truths.append(char in t)
        if False in truths:
            return False
        else:
            return True