Calc

README.md

@@ -6,9 +6,10 @@
 
 [![Open Source Love](https://firstcontributions.github.io/open-source-badges/badges/open-source-v1/open-source.svg)](https://github.com/GDSC-CEC)
 
-
 Hacktoberfest is a month-long celebration of open source software run by DigitalOcean in partnership with GitHub and Twilio. Hacktoberfest is open to everyone in our global community! Four quality pull requests must be submitted to public GitHub repositories. You can sign up anytime between October 1 and October 31.
 
+This repo is aimed at people who are new to open-source, earn and learn from that experience.
+
 ### Goal of this repository
 There are many repositories on GitHub that contain a collection of algorithms and data structures in different programming languages. The goal of this repository is to provide a collection of algorithms and data structures in Python. Aim of this repository is to become a one-stop repository for all the algorithms and data structures in Python. 
 Code should be well documented and easy to understand. The algorithms and data structures should be implemented according to the style guide mentioned below.
@@ -32,7 +33,6 @@ Please read [CONTRIBUTING.md](/CONTRIBUTING.md) and [CODE_OF_CONDUCT.md](/CODE_O
 ### Rules
 
 * There are total 70 problems open for contribution.
-* Pull Requests are accepted on **First Come First Serve Basis**.
 * Once Pull Request is accepted on one problem, no other pull request will be reviewed on the that problem. Please try to contribute on other problem if any pull request is already merged.
 * Read the [CONTRIBUTING.md](/CONTRIBUTING.md) file.
 * Respect people.

easy/binary_search/README.md

@@ -5,7 +5,7 @@
 Write a program to implement Binary Search in Python.
 
 ### Input Format
-Create a function with name binary_search that takes a list and an integer as arguments and returns the index of the integer in the list if it exists, else return -1. If invalid input is entered, return -1.
+Create a function with name solution that takes a list and an integer as arguments and returns the index of the integer in the list if it exists, else return -1. If invalid input is entered, return -1.
 
 ### Output Format
 Return an integer denoting the index of the integer in the list if it exists, else return -1.

easy/binary_search_recursion/README.md

@@ -5,7 +5,7 @@
 Write a program to implement Binary Search in Python.
 
 ### Input Format
-Create a function with name binary_search that takes a list and an integer as arguments and returns the index of the integer in the list if it exists, else return -1. If invalid input is entered, return -1.
+Create a function with name solution that takes a list and an integer as arguments and returns the index of the integer in the list if it exists, else return -1. If invalid input is entered, return -1.
 
 ### Output Format
 Return an integer denoting the index of the integer in the list if it exists, else return -1.
@@ -48,4 +48,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/binary_to_decimal/README.md

@@ -5,7 +5,7 @@
 Write a program to convert a binary number to decimal in Python.
 
 ### Input Format
-Create a function with name binary_to_decimal that takes a binary number as an argument and returns the decimal equivalent of the binary number. If invalid input is entered, return -1.
+Create a function with name solution that takes a binary number as an argument and returns the decimal equivalent of the binary number. If invalid input is entered, return -1.
 
 ### Output Format
 Return an integer denoting the decimal equivalent of the binary number.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/binary_to_decimal/tests.py

@@ -46,4 +46,4 @@ def test_binary_to_decimal_test_j(self):
 
 
 if __name__ == "__main__":
-    unittest.main()
+    utility.main()

easy/bubble_sort/README.md

@@ -5,7 +5,7 @@
 Write a program to sort a list of numbers in ascending order using Bubble Sort in Python.
 
 ### Input Format
-Create a function with name bubble_sort that takes a list of numbers as an argument and returns the sorted list of numbers. If invalid input is entered, return empty list.
+Create a function with name solution that takes a list of numbers as an argument and returns the sorted list of numbers. If invalid input is entered, return empty list.
 
 ### Output Format
 Return a list of numbers in ascending order.
@@ -46,4 +46,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/bubble_sort/tests.py

@@ -50,4 +50,4 @@ def test_bubble_sort_test_k(self):
 
 
 if __name__ == "__main__":
-    unittest.main()
+    utility.main()

easy/bubble_sort_recursion/README.md

@@ -5,7 +5,7 @@
 Write a program to sort a list of numbers in ascending order using Bubble Sort in Python.
 
 ### Input Format
-Create a function with name bubble_sort that takes a list of numbers as an argument and returns the sorted list of numbers. If invalid input is entered, return empty list.
+Create a function with name solution that takes a list of numbers as an argument and returns the sorted list of numbers. If invalid input is entered, return empty list.
 
 ### Output Format
 Return a list of numbers in ascending order.
@@ -46,4 +46,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/bubble_sort_recursion/solution.py

@@ -1,2 +1,23 @@
-def solution():
-    pass
+def solution(list_of_nums = []):
+    return bubble_sort(list_of_nums)
+
+def bubble_sort(list_of_nums):
+    # Check if it is a valid input.
+    if not list_of_nums or not isinstance(list_of_nums, list):
+        # If not a valid input return empty list.
+        return []
+
+    # Return bubble sort recursive solution
+    return recursive_sort(list_of_nums, len(list_of_nums))
+
+def recursive_sort(list_of_nums, len):
+    # Basic case.
+    if len == 1:
+        return list_of_nums
+
+    # Order sublist.
+    for i in range(len-1):
+        if list_of_nums[i] > list_of_nums[i+1]:
+            list_of_nums[i], list_of_nums[i+1] = list_of_nums[i+1], list_of_nums[i]
+
+    return recursive_sort(list_of_nums, len-1)

easy/bubble_sort_recursion/tests.py

@@ -50,4 +50,4 @@ def test_bubble_sort_test_k(self):
 
 
 if __name__ == "__main__":
-    unittest.main()
+    utility.main()

easy/calculator/README.md

@@ -5,7 +5,7 @@
 Write a program to create a calculator in Python.
 
 ### Input Format
-Create a function with name calculator that takes two numbers and an operator as arguments and returns the result of the operation. If invalid input is entered, return -1.
+Create a function with name solution that takes two numbers and an operator as arguments and returns the result of the operation. If invalid input is entered, return -1.
 
 ### Output Format
 Return the result of the operation.
@@ -51,4 +51,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/calculator/solution.py

@@ -1,2 +1,25 @@
-def solution():
-    pass
+def solution(num1, num2, op =""):
+    if(op == "+"):
+        n1 = str(num1)
+        n2 = str(num2)
+        if not n1.isdigit() and not n2.isdigit():
+            return -1
+        else:
+            calc = num1 + num2
+            return calc  
+    elif(op == "-"):
+        calc = num1 - num2
+        return calc
+    elif(op == "*"):
+        calc = num1 * num2
+        return calc
+    elif(op == "/"):
+        if(num2 == 0):
+            return -1
+        else:
+            calc = num1 / num2
+            return calc
+    else:
+        return -1
+
+

easy/calculator/tests.py

@@ -37,4 +37,4 @@ def test_calculator_test_h(self):
         self.assertEqual(solution(1, 1), -1, "Test 8 Failed")
 
 if __name__ == "__main__":
-    unittest.main()
+    utility.main()

easy/decimal_to_binary/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a decimal number as an argument and returns the binary equivalent of that number.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and returns the binary equivalent of that number.
+Create a function with name solution that takes an integer n as an argument and returns the binary equivalent of that number.
 
 #### Output Format
 Return a integer denoting the binary equivalent of the decimal number. If invalid input is entered, return 0.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/diamond_pattern/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and prints a diamond pattern of height n.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and prints a diamond pattern of height n. n should be an odd number and greater than 1. If n is even, return -1.
+Create a function with name solution that takes an integer n as an argument and prints a diamond pattern of height n. n should be an odd number and greater than 1. If n is even, return -1.
 
 #### Output Format
 Print a diamond pattern of height n. If invalid input is entered, return -1.
@@ -41,7 +41,7 @@ The diamond pattern of height 9 is:
   *****
    ***
     *
-    ```
+```
 - The first line contains 8 spaces and 1 star.
 - The second line contains 7 spaces and 3 stars.
 - The third line contains 6 spaces and 5 stars.
@@ -77,4 +77,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/factorial_iterative/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and returns the factorial of that number.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and returns the factorial of that number.
+Create a function with name solution that takes an integer n as an argument and returns the factorial of that number.
 
 #### Output Format
 Return a integer denoting the factorial of the number. If invalid input is entered, return -1.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/factorial_recursion/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and returns the factorial of that number.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and returns the factorial of that number.
+Create a function with name solution that takes an integer n as an argument and returns the factorial of that number.
 
 #### Output Format
 Return a integer denoting the factorial of the number. If invalid input is entered, return -1.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/fibonacci_iterative/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and returns the nth Fibonacci number.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and returns the nth Fibonacci number.
+Create a function with name solution that takes an integer n as an argument and returns the nth Fibonacci number.
 
 #### Output Format
 Return a integer denoting the nth Fibonacci number. If invalid input is entered, return -1.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/fibonacci_recursion/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and returns the nth Fibonacci number.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and returns the nth Fibonacci number.
+Create a function with name solution that takes an integer n as an argument and returns the nth Fibonacci number.
 
 #### Output Format
 Return a integer denoting the nth Fibonacci number. If invalid input is entered, return -1.
@@ -47,4 +47,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/fibonacci_recursion/solution.py

@@ -1,2 +1,7 @@
-def solution():
-    pass
+def solution(*args):
+    if len(args)==0:
+        return -1
+
+    if args[0]<=1:
+        return args[0]
+    return solution(args[0]-1)+solution(args[0]-2)

easy/half_diamond_pattern/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and prints a half diamond star pattern of height n.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and prints a half diamond star pattern of height n. n should be odd and greater than 1.
+Create a function with name solution that takes an integer n as an argument and prints a half diamond star pattern of height n. n should be odd and greater than 1.
 
 #### Output Format
 Print a half diamond star pattern of height n. If invalid input is entered, return -1.
@@ -55,4 +55,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/half_pyramid_pattern/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and prints a half pyramid star pattern of height n.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and prints a half pyramid star pattern of height n.
+Create a function with name solution that takes an integer n as an argument and prints a half pyramid star pattern of height n.
 
 #### Output Format
 Print a half pyramid star pattern of height n. If invalid input is entered, return -1.
@@ -51,4 +51,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/hourglass_pattern/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a number n as an argument and prints an hourglass star pattern of height n.
 
 #### Input Format
-Create a function with name answer that takes an integer n as an argument and prints an hourglass star pattern of height n. n should be odd and greater than 1.
+Create a function with name solution that takes an integer n as an argument and prints an hourglass star pattern of height n. n should be odd and greater than 1.
 
 #### Output Format
 Print an hourglass star pattern of height n. If invalid input is entered, return -1.
@@ -51,4 +51,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/insertion_sort/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a list as an argument and sorts it using the insertion sort algorithm.
 
 #### Input Format
-Create a function with name answer that takes a list as an argument and sorts it using the insertion sort algorithm.
+Create a function with name solution that takes a list as an argument and sorts it using the insertion sort algorithm.
 
 #### Output Format
 Return the sorted list. If invalid input is entered, return [].
@@ -48,4 +48,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/insertion_sort_recursion/README.md

@@ -6,7 +6,7 @@
 Write a function that takes a list as an argument and sorts it using the insertion sort algorithm.
 
 #### Input Format
-Create a function with name answer that takes a list as an argument and sorts it using the insertion sort algorithm.
+Create a function with name solution that takes a list as an argument and sorts it using the insertion sort algorithm.
 
 #### Output Format
 Return the sorted list. If invalid input is entered, return [].
@@ -48,4 +48,4 @@ If all test cases pass, your solution will be merged with the main branch. If yo
 ## License
 **This project is licensed under the GNU GENERAL PUBLIC License - see the [LICENSE](../../LICENSE) file for details**
 
-## Happy Coding! :smile:
+## Happy Coding! :smile:

easy/inverted_half_pyramid_pattern/README.md

@@ -5,8 +5,8 @@
 #### Problem Statement
 Write a function that takes a number n as an argument and prints a inverted half pyramid star pattern of height n.
 
-#### Input Format
-Create a function with name answer that takes an integer n as an argument and prints a half pyramid star pattern of height n.
+#### Input Format 
+Create a function with name solution that takes an integer n as an argument and prints a half pyramid star pattern of height n.
 
 #### Output Format
 Print a inverted half pyramid star pattern of height n. If invalid input is entered, return -1.