def many_any(lst, k):
""" Returns True if at least k elements of lst are True;
otherwise False.
"""
pass
def substrings(s):
''' Returns a set of all the substrings of s.
'''
pass
def common_chars(s, k):
''' Returns the set of characters that appear more than k times in
the input string, along with their number of occurrences (as a dict).
'''
pass
def alphabet_construct(s, alphabet):
''' Returns True if string s can be constructed from the set of length-1 strings
alphabet and False otherwise.
'''
pass
def my_sort(lst):
''' Return a sorted copy of a list. Do not modify the original list. Do
not use Python's built in sorted method or [].sort(). You may use
any sorting algorithm of your choice (mergesort or quicksort recommended.)
'''
pass
def originality_score(lst):
''' Return the number of distinct elements out of the total number of elements
Do this in one line for full credit.
'''
pass
def multisetify(lst):
''' Return a dict mapping each item in lst to the number of times it appears.
Do this in one line for full credit.
'''
pass
def word_graph(s):
''' Return a dict that maps letters of the input string s to a frozenset of
letters that appear adjacent to it somewhere in the string. Do this without
iterating through indices.
'''
pass
def main():
pass
if __name__ == "__main__":
main()