* black format
* updating DIRECTORY.md
* fixes
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* Euler problem 551 sol 1: Reduce McCabe code complexity
As discussed in #2128
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* Added maximum non-adjacent sum
* Bugfix: flake8 test
* Implemented changes (broke tuple unpacking into 2 lines due to flake8 tests)
* Implemented changes v2.0
* Update max_non_adjacent_sum.py
Co-authored-by: Christian Clauss <cclauss@me.com>
* Tighten up psf/black and flake8
* Fix some tests
* Fix some E741
* Fix some E741
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* spelling corrections
* review
* improved documentation, removed redundant variables, added testing
* added type hint
* camel case to snake case
* spelling fix
* review
* python --> Python # it is a brand name, not a snake
* explicit cast to int
* spaces in int list
* "!= None" to "is not None"
* Update comb_sort.py
* various spelling corrections in documentation & several variables naming conventions fix
* + char in file name
* import dependency - bug fix
Co-authored-by: John Law <johnlaw.po@gmail.com>
* Travis CI: Upgrade to Python 3.8
* updating DIRECTORY.md
* Tensorflow is not yet compatible with Python 3.8
* Disable k_means_clustering_tensorflow.py
* updating DIRECTORY.md
* Disable gan.py
* updating DIRECTORY.md
* Disable input_data.py
* updating DIRECTORY.md
* pip install a current version of six
* new file *iterating_through_submasks* is added in dynamic_programming section
* no changes
* *iterating_through_submasks.py is added in dynamic_programming
* iterating_through_submasks is added with doctests
* iterating_through_submasks.py is added in dynamic_programming
* changes made in *iterating_through_submasks.py
* changes made in *iterating_through_submasks.py
* updated
* Doctest and comment for maximum sub-array problem
More examples and description for max_sub_array.py
* Update max_sub_array.py
* Update max_sub_array.py
* Fix doctest
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* some pep8 cleanup too
* ENH: refactored longest common subsequence, also fixed a bug with the sequence returned
* renamed function
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* function for the knapsack problem which returns one of the optimal subsets
* some pep8 cleanup too
* Pytest the entire repo
* Do each directory for now...
* YAML files hate tabs
* Add more requirements
* pip install opencv-python
* Comment out FTP
* Add pandas and sklearn to requirements
* Comment out FTP, graphs, machine_learning, maths, neural_network, project_euler
* Update .travis.yml
* Comment out Data structures
* if __name__ == "__main__":
* pytest --ignore=
* pytest .
* Update .travis.yml
* pytest . --doctest-modules --ignore=${IGNORE}
* Ignore --ignore because it just hangs
