Merge remote-tracking branch 'upstream/master' into jenia90/2128_add_typehints_cyphers_and_bool_alg

Author: jenia90

Diff for: .github/CODEOWNERS

@@ -0,0 +1,92 @@
+# This is a comment.
+# Each line is a file pattern followed by one or more owners.
+
+# More details are here: https://help.github.com/articles/about-codeowners/
+
+# The '*' pattern is global owners.
+
+# Order is important. The last matching pattern has the most precedence.
+
+/.travis.yml  @cclauss @dhruvmanila
+
+/.pre-commit-config.yaml  @cclauss @dhruvmanila
+
+/.github/  @cclauss
+
+# /arithmetic_analysis/
+
+# /backtracking/
+
+# /bit_manipulation/
+
+# /blockchain/
+
+# /boolean_algebra/
+
+# /cellular_automata/
+
+/ciphers/  @cclauss
+
+# /compression/
+
+# /computer_vision/
+
+/conversions/  @cclauss
+
+/data_structures/  @cclauss
+
+# /digital_image_processing/
+
+# /divide_and_conquer/
+
+/dynamic_programming/ @Kush1101
+
+# /file_transfer/
+
+# /fuzzy_logic/
+
+# /genetic_algorithm/
+
+# /geodesy/
+
+# /graphics/
+
+# /graphs/
+
+# /greedy_method/
+
+# /hashes/
+
+# /images/
+
+# /linear_algebra/
+
+# /machine_learning/
+
+/maths/ @Kush1101
+
+# /matrix/
+
+# /networking_flow/
+
+# /neural_network/
+
+/other/  @cclauss
+
+/project_euler/  @dhruvmanila @Kush1101
+
+# /quantum/
+
+# /scheduling/
+
+# /scripts/
+
+# /searches/
+
+# /sorts/
+
+/strings/  @cclauss
+
+# /traversals/
+
+/web_programming/  @cclauss

Diff for: .travis.yml

@@ -12,11 +12,12 @@ jobs:
         - pytest --doctest-modules --ignore=project_euler/ --durations=10 --cov-report=term-missing:skip-covered --cov=. .
     - name: Project Euler
       install:
-        - pip install pytest-cov pytest-subtests
-      before_script:
-        - pytest --tb=no --no-summary --capture=no project_euler/validate_solutions.py || true  # fail fast on wrong solution
+        - pip install pytest-cov
       script:
         - pytest --doctest-modules --durations=10 --cov-report=term-missing:skip-covered --cov=project_euler/ project_euler/
+    - name: Project Euler Solution
+      script:
+        - pytest --tb=short --durations=10 project_euler/validate_solutions.py
 after_success:
   - scripts/build_directory_md.py 2>&1 | tee DIRECTORY.md
 notifications:

Diff for: CONTRIBUTING.md

@@ -53,7 +53,7 @@ Algorithms in this repo should not be how-to examples for existing Python packag
 
 We want your work to be readable by others; therefore, we encourage you to note the following:
 
-- Please write in Python 3.7+.  __print()__ is a function in Python 3 so __print "Hello"__ will _not_ work but __print("Hello")__ will.
+- Please write in Python 3.7+. For instance:  __print()__ is a function in Python 3 so __print "Hello"__ will _not_ work but __print("Hello")__ will.
 - Please focus hard on naming of functions, classes, and variables.  Help your reader by using __descriptive names__ that can help you to remove redundant comments.
   - Single letter variable names are _old school_ so please avoid them unless their life only spans a few lines.
   - Expand acronyms because __gcd()__ is hard to understand but __greatest_common_divisor()__ is not.
@@ -147,9 +147,9 @@ We want your work to be readable by others; therefore, we encourage you to note
 - Avoid importing external libraries for basic algorithms. Only use those libraries for complicated algorithms.
 - If you need a third party module that is not in the file __requirements.txt__, please add it to that file as part of your submission.
 
-#### Other Standard While Submitting Your Work
+#### Other Requirements for Submissions
 
-- File extension for code should be `.py`. Jupyter notebook files are acceptable in machine learning algorithms.
+- The file extension for code files should be `.py`. Jupyter Notebooks should be submitted to [TheAlgorithms/Jupyter](https://github.com/TheAlgorithms/Jupyter).
 - Strictly use snake_case (underscore_separated) in your file_name, as it will be easy to parse in future using scripts.
 - Please avoid creating new directories if at all possible. Try to fit your work into the existing directory structure.
 - If possible, follow the standard *within* the folder you are submitting to.

Diff for: DIRECTORY.md

@@ -63,6 +63,7 @@
   * [Playfair Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/playfair_cipher.py)
   * [Porta Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/porta_cipher.py)
   * [Rabin Miller](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rabin_miller.py)
+  * [Rail Fence Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rail_fence_cipher.py)
   * [Rot13](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rot13.py)
   * [Rsa Cipher](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_cipher.py)
   * [Rsa Factorization](https://github.com/TheAlgorithms/Python/blob/master/ciphers/rsa_factorization.py)
@@ -553,6 +554,8 @@
     * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_11/sol2.py)
   * Problem 112
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_112/sol1.py)
+  * Problem 119
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_119/sol1.py)
   * Problem 12
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol1.py)
     * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_12/sol2.py)
@@ -576,6 +579,8 @@
     * [Solution](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_18/solution.py)
   * Problem 19
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_19/sol1.py)
+  * Problem 191
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_191/sol1.py)
   * Problem 20
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_20/sol1.py)
     * [Sol2](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_20/sol2.py)
@@ -660,16 +665,25 @@
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_63/sol1.py)
   * Problem 67
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_67/sol1.py)
+  * Problem 69
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_69/sol1.py)
   * Problem 71
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_71/sol1.py)
+  * Problem 72
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_72/sol1.py)
   * Problem 76
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_76/sol1.py)
+  * Problem 80
+    * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_80/sol1.py)
   * Problem 97
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_97/sol1.py)
   * Problem 99
     * [Sol1](https://github.com/TheAlgorithms/Python/blob/master/project_euler/problem_99/sol1.py)
   * [Validate Solutions](https://github.com/TheAlgorithms/Python/blob/master/project_euler/validate_solutions.py)
 
+## Quantum
+  * [Single Qubit Measure](https://github.com/TheAlgorithms/Python/blob/master/quantum/single_qubit_measure.py)
+
 ## Scheduling
   * [First Come First Served](https://github.com/TheAlgorithms/Python/blob/master/scheduling/first_come_first_served.py)
   * [Round Robin](https://github.com/TheAlgorithms/Python/blob/master/scheduling/round_robin.py)
@@ -760,6 +774,7 @@
   * [Binary Tree Traversals](https://github.com/TheAlgorithms/Python/blob/master/traversals/binary_tree_traversals.py)
 
 ## Web Programming
+  * [Co2 Emission](https://github.com/TheAlgorithms/Python/blob/master/web_programming/co2_emission.py)
   * [Covid Stats Via Xpath](https://github.com/TheAlgorithms/Python/blob/master/web_programming/covid_stats_via_xpath.py)
   * [Crawl Google Results](https://github.com/TheAlgorithms/Python/blob/master/web_programming/crawl_google_results.py)
   * [Current Stock Price](https://github.com/TheAlgorithms/Python/blob/master/web_programming/current_stock_price.py)

Diff for: README.md

@@ -12,7 +12,7 @@
 
 ### All algorithms implemented in Python (for education)
 
-These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.
+These implementations are for learning purposes only. Therefore they may be less efficient than the implementations in the Python standard library.
 
 ## Contribution Guidelines
 

Diff for: ciphers/rail_fence_cipher.py

@@ -0,0 +1,102 @@
+""" https://en.wikipedia.org/wiki/Rail_fence_cipher """
+
+
+def encrypt(input_string: str, key: int) -> str:
+    """
+    Shuffles the character of a string by placing each of them
+    in a grid (the height is dependent on the key) in a zigzag
+    formation and reading it left to right.
+
+    >>> encrypt("Hello World", 4)
+    'HWe olordll'
+
+    >>> encrypt("This is a message", 0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Height of grid can't be 0 or negative
+
+    >>> encrypt(b"This is a byte string", 5)
+    Traceback (most recent call last):
+        ...
+    TypeError: sequence item 0: expected str instance, int found
+    """
+    grid = [[] for _ in range(key)]
+    lowest = key - 1
+
+    if key <= 0:
+        raise ValueError("Height of grid can't be 0 or negative")
+    if key == 1 or len(input_string) <= key:
+        return input_string
+
+    for position, character in enumerate(input_string):
+        num = position % (lowest * 2)  # puts it in bounds
+        num = min(num, lowest * 2 - num)  # creates zigzag pattern
+        grid[num].append(character)
+    grid = ["".join(row) for row in grid]
+    output_string = "".join(grid)
+
+    return output_string
+
+
+def decrypt(input_string: str, key: int) -> str:
+    """
+    Generates a template based on the key and fills it in with
+    the characters of the input string and then reading it in
+    a zigzag formation.
+
+    >>> decrypt("HWe olordll", 4)
+    'Hello World'
+
+    >>> decrypt("This is a message", -10)
+    Traceback (most recent call last):
+        ...
+    ValueError: Height of grid can't be 0 or negative
+
+    >>> decrypt("My key is very big", 100)
+    'My key is very big'
+    """
+    grid = []
+    lowest = key - 1
+
+    if key <= 0:
+        raise ValueError("Height of grid can't be 0 or negative")
+    if key == 1:
+        return input_string
+
+    temp_grid = [[] for _ in range(key)]  # generates template
+    for position in range(len(input_string)):
+        num = position % (lowest * 2)  # puts it in bounds
+        num = min(num, lowest * 2 - num)  # creates zigzag pattern
+        temp_grid[num].append("*")
+
+    counter = 0
+    for row in temp_grid:  # fills in the characters
+        splice = input_string[counter : counter + len(row)]
+        grid.append([character for character in splice])
+        counter += len(row)
+
+    output_string = ""  # reads as zigzag
+    for position in range(len(input_string)):
+        num = position % (lowest * 2)  # puts it in bounds
+        num = min(num, lowest * 2 - num)  # creates zigzag pattern
+        output_string += grid[num][0]
+        grid[num].pop(0)
+    return output_string
+
+
+def bruteforce(input_string: str) -> dict:
+    """Uses decrypt function by guessing every key
+
+    >>> bruteforce("HWe olordll")[4]
+    'Hello World'
+    """
+    results = {}
+    for key_guess in range(1, len(input_string)):  # tries every key
+        results[key_guess] = decrypt(input_string, key_guess)
+    return results
+
+
+if __name__ == "__main__":
+    import doctest
+
+    doctest.testmod()

Diff for: computer_vision/README.md

@@ -3,6 +3,5 @@
 Computer vision is a field of computer science that works on enabling computers to see,
 identify and process images in the same way that human vision does, and then provide appropriate output.
 It is like imparting human intelligence and instincts to a computer.
-Image processing and computer vision and little different from each other.Image processing means applying some algorithms for transforming image from one form to other like smoothing,contrasting, stretching etc
-While in computer vision comes from modelling image processing using the techniques of machine learning.Computer vision applies machine learning to recognize patterns for interpretation of images.
-Much like the process of visual reasoning of human vision
+Image processing and computer vision are a little different from each other. Image processing means applying some algorithms for transforming image from one form to the other like smoothing, contrasting, stretching, etc.
+While computer vision comes from modelling image processing using the techniques of machine learning, computer vision applies machine learning to recognize patterns for interpretation of images (much like the process of visual reasoning of human vision).

Diff for: project_euler/problem_11/sol1.py

@@ -68,7 +68,8 @@ def largest_product(grid):
 
 
 def solution():
-    """Returns the sum of all the multiples of 3 or 5 below n.
+    """Returns the greatest product of four adjacent numbers (horizontally,
+    vertically, or diagonally).
 
     >>> solution()
     70600674

Diff for: project_euler/problem_11/sol2.py

@@ -28,7 +28,8 @@
 
 
 def solution():
-    """Returns the sum of all the multiples of 3 or 5 below n.
+    """Returns the greatest product of four adjacent numbers (horizontally,
+    vertically, or diagonally).
 
     >>> solution()
     70600674

Diff for: project_euler/problem_119/__init__.py

@@ -0,0 +1,51 @@
+"""
+Problem 119: https://projecteuler.net/problem=119
+
+Name: Digit power sum
+
+The number 512 is interesting because it is equal to the sum of its digits
+raised to some power: 5 + 1 + 2 = 8, and 8^3 = 512. Another example of a number
+with this property is 614656 = 28^4. We shall define an to be the nth term of
+this sequence and insist that a number must contain at least two digits to have a sum.
+You are given that a2 = 512 and a10 = 614656. Find a30
+"""
+
+import math
+
+
+def digit_sum(n: int) -> int:
+    """
+    Returns the sum of the digits of the number.
+    >>> digit_sum(123)
+    6
+    >>> digit_sum(456)
+    15
+    >>> digit_sum(78910)
+    25
+    """
+    return sum([int(digit) for digit in str(n)])
+
+
+def solution(n: int = 30) -> int:
+    """
+    Returns the value of 30th digit power sum.
+    >>> solution(2)
+    512
+    >>> solution(5)
+    5832
+    >>> solution(10)
+    614656
+    """
+    digit_to_powers = []
+    for digit in range(2, 100):
+        for power in range(2, 100):
+            number = int(math.pow(digit, power))
+            if digit == digit_sum(number):
+                digit_to_powers.append(number)
+
+    digit_to_powers.sort()
+    return digit_to_powers[n - 1]
+
+
+if __name__ == "__main__":
+    print(solution())