Update CodingBat solutions - Warmup-2

Author: printdhruv

CodingBat solutions - Warmup-2

@@ -3,14 +3,104 @@
 #  Used In        : Python
 #  Used As        : Warmup-2
 #  Thoughts      =>  
-#                   Given a string and a non-negative int n, return a larger string that is n copies of the original string.
-#
+#                   This file will contain the solutions for the codingbat.com in attempt to have digest                   
+#                   for my coderschool kids.It's my own version of solutions which might be diffrent then
+#                   the actual ones.
 
 '''
-   Warmup-1 > sleep_in 
-                    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
+   Warmup-2 > string_times 
+                    Given a string and a non-negative int n, return a larger string that is n copies of the original string.
+                    string_times('Hi', 2) → 'HiHi'
+                    string_times('Hi', 3) → 'HiHiHi'
+                    string_times('Hi', 1) → 'Hi'
 '''
+
+def string_times(str, n):
+  return str*n
+
+'''
+   Warmup-2 > front_times
+                    Given a string and a non-negative int n, we'll say that the front of the string is the first 3 chars, 
+                    or whatever is there if the string is less than length 3. Return n copies of the front.
+                    front_times('Chocolate', 2) → 'ChoCho'
+                    front_times('Chocolate', 3) → 'ChoChoCho'
+                    front_times('Abc', 3) → 'AbcAbcAbc'
+'''
+
+def front_times(str, n):
+  if len(str) < 3:
+    return str*n
+  else:
+    return str[0:3]*n
+
+
+'''
+   Warmup-2 > string_bits 
+                    Given a string, return a new string made of every other char starting with the first, so "Hello" yields "Hlo".
+                    string_bits('Hello') → 'Hlo'
+                    string_bits('Hi') → 'H'
+                    string_bits('Heeololeo') → 'Hello'
+'''
+
+def string_bits(str):
+  answer = ""
+  for i in range(0,len(str),2):
+    answer += str[i]
+  return answer
+  
+
+'''
+   Warmup-2 > string_splosion
+                    Given a non-empty string like "Code" return a string like "CCoCodCode".
+                    string_splosion('Code') → 'CCoCodCode'
+                    string_splosion('abc') → 'aababc'
+                    string_splosion('ab') → 'aab'
+'''
+
+def string_splosion(str):
+  answer = ""
+  j = -1
+  for i in range(0,len(str)+1):
+    j = j+1
+    for k in range(0,j):
+      answer += str[k]
+  return answer
+  
+  
+'''
+   Warmup-2 > last2 
+                    Given a string, return the count of the number of times that a substring 
+                    length 2 appears in the string and also as the last 2 chars of the string, 
+                    so "hixxxhi" yields 1 (we won't count the end substring).
+                    last2('hixxhi') → 1
+                    last2('xaxxaxaxx') → 1
+                    last2('axxxaaxx') → 2
+'''
+
+def last2(str):
+  if len(str)<2:
+    return 0
+  last = str[len(str)-2:]
+  count = 0
+  for i in range(len(str)-2):
+    sub = str[i:i+2]
+    if sub == last:
+      count = count + 1
+  return count
+  
+
+'''
+   Warmup-2 > last2 
+                    Given an array of ints, return the number of 9's in the array.
+                    array_count9([1, 2, 9]) → 1
+                    array_count9([1, 9, 9]) → 2
+                    array_count9([1, 9, 9, 3, 9]) → 3
+'''
+
+def array_count9(nums):
+  count = 0
+  for i in nums:
+    if i == 9:
+      count = count + 1
+  return count
+