complete all the free challenges in coderbyte

Author: Liangmp

README.md

@@ -1,4 +1,4 @@
-Here are my solutions for coding challenges in [coderbyte](https://www.coderbyte.com)
+Here are my solutions for coding challenges in [coderbyte](https://www.coderbyte.com).
 
 Hope you have fun with these coding challenges.
 
@@ -19,10 +19,14 @@ Keep updating.
   - I hate bruteforce!
 - Scale Balancing
 - Vowel Square
+  - Simple searching.
+- Closest Enemy II
+  - The key to solve this challenge is to handle wrappingl.
+- Question Marks
 
 ## Medium:
 - Eight Queens
-  - This challenge only asks you to determine if there is any attack, which is much more simple than to find solutions that no queen attacking each other as described in [wiki](https://en.wikipedia.org/wiki/Eight_queens_puzzle#Solutions)
+  - This challenge only asks you to determine if there is any attack, which is much more simple than to find solutions that no queen attacking each other as described in [wikiedia](https://en.wikipedia.org/wiki/Eight_queens_puzzle#Solutions).
 
 ## Hard
 - Kaprekars Constant 

coderbyte-ClosestEnemyII.py

@@ -0,0 +1,33 @@
+'''
+Challenge
+Have the function ClosestEnemyII(strArr) read the matrix of numbers stored in strArr which will be a 2D matrix that contains only the integers 1, 0, or 2. Then from the position in the matrix where a 1 is, return the number of spaces either left, right, down, or up you must move to reach an enemy which is represented by a 2. You are able to wrap around one side of the matrix to the other as well. For example: if strArr is ["0000", "1000", "0002", "0002"] then this looks like the following: 
+
+0 0 0 0
+1 0 0 0
+0 0 0 2
+0 0 0 2 
+
+For this input your program should return 2 because the closest enemy (2) is 2 spaces away from the 1 by moving left to wrap to the other side and then moving down once. The array will contain any number of 0's and 2's, but only a single 1. It may not contain any 2's at all as well, where in that case your program should return a 0. 
+
+Sample Test Cases:
+
+Input:["000", "100", "200"]
+Output:1
+
+Input:["0000", "2010", "0000", "2002"]
+Output:2
+'''
+
+def ClosestEnemyII(array):
+    enemies = []
+    for i, row in enumerate(array):
+        for j, col in enumerate(list(row)):
+            if col == '1': px, py = (i, j)
+            if col == '2': enemies.append((i, j))
+    moves = []
+    for x, y in enemies:
+        no_wrap = abs(px - x) + abs(py - y)
+        col_wrap, row_wrap = abs(px - x) + abs(py - (y - len(array))), abs(px - (x - len(array))) + abs(py-y)
+        moves.append(min(no_wrap, col_wrap, row_wrap))
+    return min(moves) if moves else 0
+print ClosestEnemyII(raw_input())

coderbyte-QuestionsMarks.py

@@ -0,0 +1,34 @@
+'''
+Challenge
+
+Have the function QuestionsMarks(str) take the str string parameter, which will contain single digit numbers, letters, and question marks, and check if there are exactly 3 question marks between every pair of two numbers that add up to 10. If so, then your program should return the string true, otherwise it should return the string false. If there aren't any two numbers that add up to 10 in the string, then your program should return false as well. 
+
+For example: if str is "arrb6???4xxbl5???eee5" then your program should return true because there are exactly 3 question marks between 6 and 4, and 3 question marks between 5 and 5 at the end of the string. 
+
+Sample Test Cases
+
+Input:"aa6?9"
+Output:false
+
+Input:"acc?7??sss?3rr1??????5"
+Output:true
+'''
+
+def QuestionsMarks(s): 
+    numbers = '1234567890'
+    lastDigit = None
+    answer = 'false'
+    for i in range(0, len(s)):
+        if s[i].isdigit():
+            if lastDigit:
+                if int(s[i]) + int(s[lastDigit]) == 10:
+                    if s[lastDigit:i].count('?') == 3:
+                        answer = 'true'
+                    else:
+                        return 'false'
+            lastDigit = i
+    
+    return answer
+    
+# keep this function call here  
+print QuestionsMarks(raw_input())