WarmUp-1.py

'''
The parameter weekday is True if it is a weekday, and the parameter vacation is True if we are on vacation. We sleep in if it is not a weekday or we're on vacation. Return True if we sleep in.


sleep_in(False, False) → True
sleep_in(True, False) → False
sleep_in(False, True) → True
'''
def sleep_in(weekday, vacation):
  return weekday==False or vacation==True

'''
We have two monkeys, a and b, and the parameters a_smile and b_smile indicate if each is smiling. We are in trouble if they are both smiling or if neither of them is smiling. Return True if we are in trouble.


monkey_trouble(True, True) → True
monkey_trouble(False, False) → True
monkey_trouble(True, False) → False
'''
def monkey_trouble(a_smile, b_smile):
  return (a_smile==True and b_smile==True) or (a_smile==False and b_smile==False)


#Given two int values, return their sum. Unless the two values are the same, then return double their sum.
def sum_double(a, b):
  if(a==b):
    return sum([a,b])*2
  else:
    return sum([a,b])

#Given an int n, return the absolute difference between n and 21, except return double the absolute difference if n is over 21.
def diff21(n):
  if(n>21):
    return abs(21-n)*2
  else:
    return abs(21-n)

#We have a loud talking parrot. The "hour" parameter is the current hour time in the range 0..23. We are in trouble if the parrot is talking and the hour is before 7 or after 20. Return True if we are in trouble.
def parrot_trouble(talking, hour):
  return (talking==True) and (hour <7 or hour>20)

#Given 2 ints, a and b, return True if one if them is 10 or if their sum is 10.
def makes10(a, b):
    return 10 in (a, b) or sum([a, b]) == 10

#Given an int n, return True if it is within 10 of 100 or 200. Note: abs(num) computes the absolute value of a number.
def near_hundred(n):
  return abs(n-100)<=10 or abs(n-200)<=10

#Given 2 int values, return True if one is negative and one is positive. Except if the parameter "negative" is True, then return True only if both are negative.
def pos_neg(a, b, negative):
    if (negative == True):
        return (a < 0 and b < 0)
    else:
        return (a > 0 and b < 0) or (a < 0 and b > 0)


#Given a string, return a new string where "not " has been added to the front. However, if the string already begins with "not", return the string unchanged.
def not_string(str):
  l=str.split()
  if(l[0]=='not'):
    return str
  else:
    l.insert(0,'not')
    return " ".join(l)

#Given a non-empty string and an int n, return a new string where the char at index n has been removed. The value of n will be a valid index of a char in the original string (i.e. n will be in the range 0..len(str)-1 inclusive)
def missing_char(str, n):
  s=str[:n]+str[n+1:]
  return s

#Given a string, return a new string where the first and last chars have been exchanged.
def front_back(str):
  if(len(str)<=1):
    return str
  mid=str[1:len(str)-1]
  return str[len(str)-1]+mid+str[0]

#Given a string, we'll say that the front is the first 3 chars of the string. If the string length is less than 3, the front is whatever is there. Return a new string which is 3 copies of the front.
def front3(str):
  if(len(str)<=3):
    return str*3
  else:
    return str[0:3]*3