from collections import defaultdict
def all_but_few(lst, k):
""" Returns a bool True if all but at most k elements are True (or truthy) in lst and
False otherwise. That is, a list with 0, 1, ..., k elements False (or falsy) should
return True. Otherwise, for k + 1 elements or more falsy, return False.
"""
pass
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 diff_score(s1, s2):
''' Compute a measure of difference between two ordered sequences. For
each index where the sequences have different (but present) values, add
-1 to the score. For each index where one sequence overhangs another,
add -2 to the score. For every three consecutive indices where the
sequences are identical, add +1 to the score. For example, take:
abcd12
abcd3
Since [0:3] and [1:4] are shared, add +2. Subtract 1 for the difference
at [4] and subtract 2 for the overhang at [5], giving score of -1.
'''
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.
'''
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 main():
pass
if __name__ == "__main__":
main()