update readme

Author: developeratul

problems/adding-and-removing-dots.py

@@ -1,22 +1,22 @@
-"""
-Adding and removing dots
-
-Write a function named add_dots that takes a string and adds "." in between each letter. For example, calling add_dots("test") should return the string "t.e.s.t".
-
-Then, below the add_dots function, write another function named remove_dots that removes all dots from a string. For example, calling remove_dots("t.e.s.t") should return "test".
-
-If both functions are correct, calling remove_dots(add_dots(string)) should return back the original string for any string.
-
-(You may assume that the input to add_dots does not itself contain any dots.)
-"""
-
-
-def add_dots(string):
-    return ".".join(list(string))
-
-
-def remove_dots(string):
-    return string.replace(".", "")
-
-
+"""
+Adding and removing dots
+
+Write a function named add_dots that takes a string and adds "." in between each letter. For example, calling add_dots("test") should return the string "t.e.s.t".
+
+Then, below the add_dots function, write another function named remove_dots that removes all dots from a string. For example, calling remove_dots("t.e.s.t") should return "test".
+
+If both functions are correct, calling remove_dots(add_dots(string)) should return back the original string for any string.
+
+(You may assume that the input to add_dots does not itself contain any dots.)
+"""
+
+
+def add_dots(string):
+    return ".".join(list(string))
+
+
+def remove_dots(string):
+    return string.replace(".", "")
+
+
 print(remove_dots(add_dots("hello")))

problems/all-equal.py

@@ -1,28 +1,28 @@
-"""
-All equal
-
-Define a function named all_equal that takes a list and checks whether all elements in the list are the same.
-
-For example, calling all_equal([1, 1, 1]) should return True.
-"""
-
-
-def all_equal(l):
-    result = True
-    for i in range(len(l) - 1):
-        if l[i] != l[i + 1]:
-            result = False
-
-    return result
-
-
-print(all_equal([1, 1, 1, 1]))
-print(all_equal([1, 2, 1, 1]))
-
-# naive solution
-""" def all_equal(items):
-    for item1 in items:
-        for item2 in items:
-            if item1 != item2:
-                return False
+"""
+All equal
+
+Define a function named all_equal that takes a list and checks whether all elements in the list are the same.
+
+For example, calling all_equal([1, 1, 1]) should return True.
+"""
+
+
+def all_equal(l):
+    result = True
+    for i in range(len(l) - 1):
+        if l[i] != l[i + 1]:
+            result = False
+
+    return result
+
+
+print(all_equal([1, 1, 1, 1]))
+print(all_equal([1, 2, 1, 1]))
+
+# naive solution
+""" def all_equal(items):
+    for item1 in items:
+        for item2 in items:
+            if item1 != item2:
+                return False
     return True """

problems/anagrams.py

@@ -1,19 +1,19 @@
-"""
-Anagrams
-
-Two strings are anagrams if you can make one from the other by rearranging the letters.
-
-Write a function named is_anagram that takes two strings as its parameters. Your function should return True if the strings are anagrams, and False otherwise.
-
-For example, the call is_anagram("typhoon", "opython") should return True while the call is_anagram("Alice", "Bob") should return False.
-"""
-
-
-def is_anagram(str1, str2):
-    str1 = "".join(sorted(str1))
-    str2 = "".join(sorted(str2))
-    return str1 == str2
-
-
-print(is_anagram("python", "nohtyp"))
+"""
+Anagrams
+
+Two strings are anagrams if you can make one from the other by rearranging the letters.
+
+Write a function named is_anagram that takes two strings as its parameters. Your function should return True if the strings are anagrams, and False otherwise.
+
+For example, the call is_anagram("typhoon", "opython") should return True while the call is_anagram("Alice", "Bob") should return False.
+"""
+
+
+def is_anagram(str1, str2):
+    str1 = "".join(sorted(str1))
+    str2 = "".join(sorted(str2))
+    return str1 == str2
+
+
+print(is_anagram("python", "nohtyp"))
 print(is_anagram("python", "JavaScript"))

problems/capital-indexes.py

@@ -1,14 +1,14 @@
-"""
-Capital indexes
-
-Write a function named capital_indexes. The function takes a single parameter, which is a string. Your function should return a list of all the indexes in the string that have capital letters.
-
-For example, calling capital_indexes("HeLlO") should return the list [0, 2, 4].
-"""
-
-
-def capital_indexes(string):
-    return [i for i, char in enumerate(string) if char.isupper()]
-
-
-print(capital_indexes("HeLlO"))
+"""
+Capital indexes
+
+Write a function named capital_indexes. The function takes a single parameter, which is a string. Your function should return a list of all the indexes in the string that have capital letters.
+
+For example, calling capital_indexes("HeLlO") should return the list [0, 2, 4].
+"""
+
+
+def capital_indexes(string):
+    return [i for i, char in enumerate(string) if char.isupper()]
+
+
+print(capital_indexes("HeLlO"))

problems/consecutive-zeros.py

@@ -1,26 +1,26 @@
-"""
-Consecutive zeros
-
-The goal of this challenge is to analyze a binary string consisting of only zeros and ones. Your code should find the biggest number of consecutive zeros in the string. For example, given the string:
-
-"1001101000110"
-The biggest number of consecutive zeros is 3.
-
-Define a function named consecutive_zeros that takes a single parameter, which is the string of zeros and ones. Your function should return the number described above.
-"""
-
-
-def consecutive_zeros(string):
-    string_list = string.split("1")
-    for i in string_list:
-        if i == "":
-            string_list.remove(i)
-    result = 0
-    for i in string_list:
-        if len(i) > result:
-            result = len(i)
-    return result
-
-
-print(consecutive_zeros("1000000"))
+"""
+Consecutive zeros
+
+The goal of this challenge is to analyze a binary string consisting of only zeros and ones. Your code should find the biggest number of consecutive zeros in the string. For example, given the string:
+
+"1001101000110"
+The biggest number of consecutive zeros is 3.
+
+Define a function named consecutive_zeros that takes a single parameter, which is the string of zeros and ones. Your function should return the number described above.
+"""
+
+
+def consecutive_zeros(string):
+    string_list = string.split("1")
+    for i in string_list:
+        if i == "":
+            string_list.remove(i)
+    result = 0
+    for i in string_list:
+        if len(i) > result:
+            result = len(i)
+    return result
+
+
+print(consecutive_zeros("1000000"))
 print(consecutive_zeros("1001101000110"))

problems/counting-sylables.py

@@ -1,19 +1,19 @@
-"""
-Counting syllables
-Define a function named count that takes a single parameter. The parameter is a string. The string will contain a single word divided into syllables by hyphens, such as these:
-
-"ho-tel"
-"cat"
-"met-a-phor"
-"ter-min-a-tor"
-Your function should count the number of syllables and return it.
-
-For example, the call count("ho-tel") should return 2.
-"""
-
-
-def count(string):
-    return len(string.split("-"))
-
-
+"""
+Counting syllables
+Define a function named count that takes a single parameter. The parameter is a string. The string will contain a single word divided into syllables by hyphens, such as these:
+
+"ho-tel"
+"cat"
+"met-a-phor"
+"ter-min-a-tor"
+Your function should count the number of syllables and return it.
+
+For example, the call count("ho-tel") should return 2.
+"""
+
+
+def count(string):
+    return len(string.split("-"))
+
+
 print(count("ho-tel-code"))

problems/divisible-by-3.py

@@ -1,14 +1,14 @@
-"""
-Divisible by 3
-Define a function named div_3 that returns True if its single integer parameter is divisible by 3 and False otherwise.
-
-For example, div_3(6) is True because 6/3 does not leave any remainder. However div_3(5) is False because 5/3 leaves 2 as a remainder.
-"""
-
-
-def div_3(num):
-    return num % 3 == 0
-
-
-print(div_3(3))
-print(div_3(100))
+"""
+Divisible by 3
+Define a function named div_3 that returns True if its single integer parameter is divisible by 3 and False otherwise.
+
+For example, div_3(6) is True because 6/3 does not leave any remainder. However div_3(5) is False because 5/3 leaves 2 as a remainder.
+"""
+
+
+def div_3(num):
+    return num % 3 == 0
+
+
+print(div_3(3))
+print(div_3(100))

problems/double-letters.py

@@ -1,24 +1,24 @@
-"""
-Double letters
-
-The goal of this challenge is to analyze a string to check if it contains two of the same letter in a row. For example, the string "hello" has l twice in a row, while the string "nono" does not have two identical letters in a row.
-
-Define a function named double_letters that takes a single parameter. The parameter is a string. Your function must return True if there are two identical letters in a row in the string, and False otherwise
-"""
-
-
-def double_letters(string):
-    result = False
-    for i in range(len(string) - 1):
-        if string[i] == string[i + 1]:
-            result = True
-    return result
-
-
-print(double_letters("boom"))
-print(double_letters("damn!"))
-
-# shorter solution
-# using a list comprehension, zip, and any
-""" def double_letters(string):
+"""
+Double letters
+
+The goal of this challenge is to analyze a string to check if it contains two of the same letter in a row. For example, the string "hello" has l twice in a row, while the string "nono" does not have two identical letters in a row.
+
+Define a function named double_letters that takes a single parameter. The parameter is a string. Your function must return True if there are two identical letters in a row in the string, and False otherwise
+"""
+
+
+def double_letters(string):
+    result = False
+    for i in range(len(string) - 1):
+        if string[i] == string[i + 1]:
+            result = True
+    return result
+
+
+print(double_letters("boom"))
+print(double_letters("damn!"))
+
+# shorter solution
+# using a list comprehension, zip, and any
+""" def double_letters(string):
     return any([a == b for a, b in zip(string, string[1:])]) """

problems/flatten-list.py

@@ -1,28 +1,28 @@
-"""
-Flatten a list
-Write a function that takes a list of lists and flattens it into a one-dimensional list.
-
-Name your function flatten. It should take a single parameter and return a list.
-
-For example, calling:
-
-flatten([[1, 2], [3, 4]])
-Should return the list:
-
-[1, 2, 3, 4]
-"""
-
-
-def flatten(l):
-    result = []
-    for i in l:
-        if type(i) == list:
-            for j in i:
-                result.append(j)
-        else:
-            result.append(i)
-    return result
-
-
-print(flatten([[1, 2], [3, 4], 5, 6, 7]))
-print(flatten([[1, 2], [3, 4]]))
+"""
+Flatten a list
+Write a function that takes a list of lists and flattens it into a one-dimensional list.
+
+Name your function flatten. It should take a single parameter and return a list.
+
+For example, calling:
+
+flatten([[1, 2], [3, 4]])
+Should return the list:
+
+[1, 2, 3, 4]
+"""
+
+
+def flatten(l):
+    result = []
+    for i in l:
+        if type(i) == list:
+            for j in i:
+                result.append(j)
+        else:
+            result.append(i)
+    return result
+
+
+print(flatten([[1, 2], [3, 4], 5, 6, 7]))
+print(flatten([[1, 2], [3, 4]]))