@@ -0,0 +1,16 @@
+# A child is playing with a ball on the nth floor of a tall building. 
+# The height of this floor, h, is known.
+
+def bouncing_ball(h, bounce, window):
+    if h > 0 and bounce > 0 and bounce < 1 and window < h:
+        n = 0
+        jump = False
+        while h > window:
+            h = bounce * h
+            n += 1
+            if jump:
+                n += 1
+            jump = True
+        return n
+    else:
+        return - 1
@@ -0,0 +1,15 @@
+# The goal of this exercise is to convert a string to a new string where each 
+# character in the new string is "(" if that character appears only once in the
+# original string, or ")" if that character appears more than once in the 
+# original string. Ignore capitalization when determining if a character is a 
+# duplicate.
+
+def duplicate_encode(word):
+    s = ''
+    word = word.lower()
+    for c in word:
+        if word.count(c) > 1:
+            s += ')'
+        else:
+            s += '('
+    return s
@@ -0,0 +1,19 @@
+# Given a string of words, you need to find the highest scoring word.
+# Each letter of a word scores points according to its position in the 
+# alphabet: a = 1, b = 2, c = 3 etc.
+# You need to return the highest scoring word as a string.
+# If two words score the same, return the word that appears earliest in the 
+# original string.
+# All letters will be lowercase and all inputs will be valid.
+
+def high(x):
+    s_word = ''
+    s_score = 0
+    for word in x.split(' '):
+        score = 0
+        for c in word:
+            score += (ord(c) - 96) # ACII order
+        if score > s_score:
+            s_score = score
+            s_word = word
+    return s_word
@@ -0,0 +1,15 @@
+# Write a function, persistence, that takes in a positive parameter num and 
+# returns its multiplicative persistence, which is the number of times you 
+# must multiply the digits in num until you reach a single digit.
+
+# (because 3*9 = 27, 2*7 = 14, 1*4 = 4 and 4 has only one digit)
+
+def persistence(n):
+    result = 0
+    while n > 9:
+        tmp = 1
+        for i in str(n):
+            tmp *= int(i)
+        n = tmp
+        result += 1
+    return result