first commit

Author: Liangmp

README.md

@@ -0,0 +1,3 @@
+Here are my solutions for coding challenges in [coderbyte](https://www.coderbyte.com)
+
+Hope you have fun with these coding challenges.

coderbyte-AlphabetSoup.py

@@ -0,0 +1,13 @@
+'''
+Have the function AlphabetSoup(str) take the str string parameter being passed and return the string with the letters in alphabetical order (ie. hello becomes ehllo). Assume numbers and punctuation symbols will not be included in the string. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def AlphabetSoup(str): 
+    str = "".join(sorted(str))
+    # code goes here 
+    return str
+    
+# keep this function call here  
+print AlphabetSoup(raw_input())

coderbyte-CheckNums.py

@@ -0,0 +1,16 @@
+'''
+Have the function CheckNums(num1,num2) take both parameters being passed and return the string true if num2 is greater than num1, otherwise return the string false. If the parameter values are equal to each other then return the string -1. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def CheckNums(num1,num2): 
+    if num2 > num1:
+        return 'true'
+    elif num2 < num1:
+        return 'false'
+    else:
+        return '-1'
+    
+# keep this function call here  
+print CheckNums(raw_input())

coderbyte-ChessboardTraveling.py

@@ -0,0 +1,38 @@
+'''
+Challenge (hard)
+
+Have the function ChessboardTraveling(str) read str which will be a string consisting of the location of a space on a standard 8x8 chess board with no pieces on the board along with another space on the chess board. The structure of str will be the following: "(x y)(a b)" where (x y) represents the position you are currently on with x and y ranging from 1 to 8 and (a b) represents some other space on the chess board with a and b also ranging from 1 to 8 where a > x and b > y. Your program should determine how many ways there are of traveling from (x y) on the board to (a b) moving only up and to the right. For example: if str is (1 1)(2 2) then your program should output 2 because there are only two possible ways to travel from space (1 1) on a chessboard to space (2 2) while making only moves up and to the right. 
+
+Hard challenges are worth 15 points and you are not timed for them.
+Sample Test Cases
+
+Input:"(1 1)(3 3)"
+
+Output:6
+
+
+Input:"(2 2)(4 3)"
+
+Output:3
+
+'''
+
+def ChessboardTraveling(str): 
+    x, y, a, b = (int(str[1]), int(str[3]), int(str[6]), int(str[8]))
+    rightSteps = a - x
+    upSteps = b - y
+    totalSteps = rightSteps + upSteps
+    totalSteps_permutation = permutation(totalSteps)
+    upSteps_permutation = permutation(upSteps)
+    rightSteps_permutation = permutation(rightSteps)
+    posibleSteps = int(totalSteps_permutation / (upSteps_permutation * rightSteps_permutation))
+    return posibleSteps
+
+def permutation(num):
+    result = 1
+    for i in range(1, num+1):
+        result *= i
+    return result
+    
+# keep this function call here  
+print ChessboardTraveling(raw_input())

coderbyte-FirstFactorial.py

@@ -0,0 +1,14 @@
+'''
+Have the function FirstFactorial(num) take the num parameter being passed and return the factorial of it. For example: if num = 4, then your program should return (4 * 3 * 2 * 1) = 24. For the test cases, the range will be between 1 and 18 and the input will always be an integer. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def FirstFactorial(num): 
+    if num == 1:
+        return 1
+    else:
+        return num * FirstFactorial(num - 1)
+
+str = input()
+print(FirstFactorial(str))

coderbyte-FirstReverse.py

@@ -0,0 +1,27 @@
+'''
+Challenge
+Have the function FirstReverse(str) take the str parameter being passed and return the string in reversed order. For example: if the input string is "Hello World and Coders" then your program should return the string sredoC dna dlroW olleH. 
+Sample Test Cases
+
+Input:"coderbyte"
+
+Output:etybredoc
+
+
+Input:"I Love Code"
+
+Output:edoC evoL I
+'''
+
+def FirstReverse(str): 
+    lenStr = len(str)
+    revert = ""
+    for i in range(lenStr):
+        revert = revert + str[lenStr-i-1]
+    # code goes here 
+    str = revert
+    return str
+    
+# keep this function call here  
+str = input()
+print(FirstReverse(str)

coderbyte-KaprekarsConstant.py

@@ -0,0 +1,41 @@
+'''
+Challenge(hard)
+
+Have the function KaprekarsConstant(num) take the num parameter being passed which will be a 4-digit number with at least two distinct digits. Your program should perform the following routine on the number: Arrange the digits in descending order and in ascending order (adding zeroes to fit it to a 4-digit number), and subtract the smaller number from the bigger number. Then repeat the previous step. Performing this routine will always cause you to reach a fixed number: 6174. Then performing the routine on 6174 will always give you 6174 (7641 - 1467 = 6174). Your program should return the number of times this routine must be performed until 6174 is reached. For example: if num is 3524 your program should return 3 because of the following steps: (1) 5432 - 2345 = 3087, (2) 8730 - 0378 = 8352, (3) 8532 - 2358 = 6174. 
+
+Hard challenges are worth 15 points and you are not timed for them.
+Sample Test Cases
+
+Input:2111
+
+Output:5
+
+
+Input:9831
+
+Output:7
+
+'''
+
+count = 0
+
+def KaprekarsConstant(num): 
+    global count
+    if num == '6174':
+        return count
+    else:
+        num1 = "".join(sorted(str(num))) #ascending order
+        num2 = "".join(sorted(str(num), reverse=True)) #descending order
+        num1 = int(num1)
+        num2 = int(num2)
+        subtractResult = abs(num1 - num2)
+        diff = str(subtractResult)
+        diffLength = len(diff)
+        if diffLength < 4:
+            for i in range(0, 4-diffLength):
+                diff = '0' + diff
+        count += 1
+        return KaprekarsConstant(str(diff))
+    
+# keep this function call here  
+print KaprekarsConstant(raw_input())

coderbyte-LetterCapitalize.py

@@ -0,0 +1,20 @@
+'''
+Have the function LetterCapitalize(str) take the str parameter being passed and capitalize the first letter of each word. Words will be separated by only one space. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def LetterCapitalize(str): 
+
+    list = str.split(" ")
+    newStr = ""
+    for word in list:
+        newStr += word[0].upper()
+        for i in range(1, len(word)):
+            newStr += word[i]
+        newStr += " "
+    newStr = newStr[:-1]
+    return newStr
+    
+# keep this function call here  
+print LetterCapitalize(raw_input())

coderbyte-LetterChanges.py

@@ -0,0 +1,44 @@
+### coderbyte
+
+'''
+Challenge
+Have the function LetterChanges(str) take the str parameter being passed and modify it using the following algorithm. Replace every letter in the string with the letter following it in the alphabet (ie. c becomes d, z becomes a). Then capitalize every vowel in this new string (a, e, i, o, u) and finally return this modified string. 
+Sample Test Cases
+
+
+Input:"hello*3"
+
+Output:Ifmmp*3
+
+
+Input:"fun times!"
+
+Output:gvO Ujnft!
+
+'''
+
+def LetterChanges(str): 
+    letterList = "abcdefghijklmnopqrstuvwxyz"
+    vowelList = "aeiou"
+    str = str.lower()
+    newStr = ""
+    
+    # to the next letter
+    for i in range(len(str)):
+        if str[i].isalpha():
+            index = letterList.find(str[i])
+            letter = letterList[index+1]
+            if vowelList.find(letter) != -1:
+                letter = letter.upper()
+            newStr = newStr + letter
+        else:
+            newStr = newStr + str[i]
+        
+    str = newStr
+    return str
+    
+# keep this function call here  
+str = input()
+#letterList = "abcdefghijklmnopqrstuvwxyz"
+#print(letterList.find("a"))
+print(LetterChanges(str))

coderbyte-LongestWord.py

@@ -0,0 +1,20 @@
+'''
+Have the function LongestWord(sen) take the sen parameter being passed and return the largest word in the string. If there are two or more words that are the same length, return the first word from the string with that length. Ignore punctuation and assume sen will not be empty. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+import re
+
+def LongestWord(sen): 
+    list = sen.split(" ")
+    longest = re.sub(r'[^a-zA-Z0-9]',"", list[0])
+    for word in list:
+        word = re.sub(r'[^a-zA-Z0-9]',"", word)
+        if len(word) > len(longest):
+            longest = word
+    return longest
+    
+# keep this function call here  
+str = input()
+print(LongestWord(str))

coderbyte-SimpleAdding.py

@@ -0,0 +1,14 @@
+'''
+Have the function SimpleAdding(num) add up all the numbers from 1 to num. For example: if the input is 4 then your program should return 10 because 1 + 2 + 3 + 4 = 10. For the test cases, the parameter num will be any number from 1 to 1000. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def SimpleAdding(num): 
+    sum = num
+    for i in range(num):
+        sum += i
+    return sum
+    
+# keep this function call here  
+print SimpleAdding(raw_input())

coderbyte-SimpleSymbols.py

@@ -0,0 +1,16 @@
+'''
+Have the function SimpleSymbols(str) take the str parameter being passed and determine if it is an acceptable sequence by either returning the string true or false. The str parameter will be composed of + and = symbols with several letters between them (ie. ++d+===+c++==a) and for the string to be true each letter must be surrounded by a + symbol. So the string to the left would be false. The string will not be empty and will have at least one letter. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def SimpleSymbols(str): 
+    str = '=' + str + '='
+    for c in str:
+        if c.isalpha():
+            if not str[str.index(c)-1] == '+' or not str[str.index(c)+1] == '+':
+                return 'false'
+    return 'true'
+    
+# keep this function call here  
+print SimpleSymbols(raw_input())

coderbyte-TimeConvert.py

@@ -0,0 +1,14 @@
+'''
+Have the function TimeConvert(num) take the num parameter being passed and return the number of hours and minutes the parameter converts to (ie. if num = 63 then the output should be 1:3). Separate the number of hours and minutes with a colon. 
+
+Use the Parameter Testing feature in the box below to test your code with different arguments.
+'''
+
+def TimeConvert(num): 
+    hour = int(num/60)
+    min = num - hour * 60
+    # code goes here 
+    return str(hour) + ':' + str(min)
+    
+# keep this function call here  
+print TimeConvert(raw_input())