warmup-1.py

# sleep_in
def sleep_in(weekday, vacation):
    '''
    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.
    '''
    return not weekday or vacation

# monkey_trouble
def monkey_trouble(a_smile, b_smile):
    '''
    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.
    '''
    return a_smile == b_smile

# sum_double 
def sum_double(a, b):
    '''
    Given two int values, return their sum. Unless the two values are the same, then return
    double their sum.
    '''
    sum = a + b

    if a == b:
        sum = sum * 2

    return sum
# sum_double solution2
def sum_double(a, b):
    if a==b:
        return 2*(a+b)
    return a+b

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

# parrot_trouble
def parrot_trouble(talking, hour):
    '''
    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.
    '''
    return talking and hour not in range(7,21)

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

# near_hundred
def near_hundred(n):
    '''
    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.
    '''
    return((abs(100 - n) <= 10) or (abs(200 - n) <= 10))

# pos_neg
def pos_neg(a, b, negative):
    '''
    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.
    '''
    if negative:
        return a < 0 and b < 0
    return (a > 0 and b < 0) or (a < 0 and b > 0)

# not_string
def not_string(str):
    '''
    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.
    '''
    if str[0:3] ==  'not':
        return str
    return 'not ' + str

# missing_char
def missing_char(str, n):
    '''
    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 strin
    (i.e. n will be in the range 0..len(str)-1 inclusive).
    '''
    front = str[:n]
    end = str[n+1:]
    return front + end
# missing_char solution2
def missing_char(str, n):
    return str[:n]+str[n+1:]

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

# front3
def front3(str):
    '''
    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.
    '''
    if len(str) <= 3:
        return(str * 3)
    else:
        return(str[:3] * 3)
# front3 solution2
def front3(str):
    return str[0:3]*3