* 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>
* fix: space count in strings/word_occurrence.py
* Update strings/word_occurrence.py
Co-Authored-By: Christian Clauss <cclauss@me.com>
* Update strings/word_occurrence.py
Co-Authored-By: Christian Clauss <cclauss@me.com>
* Update strings/word_occurrence.py
Co-Authored-By: Christian Clauss <cclauss@me.com>
* Update word_occurrence.py
Seems like, there is no need o `occurrence.pop('', None)`
Co-authored-by: Christian Clauss <cclauss@me.com>
* Create Python/quantum/README.md
Started at #1831
* fixup! Format Python code with psf/black push
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
* Python Program that fetches top trending news
* Python Program that fetches top trending news
* Revisions in Fetch BBC News
* psf/black Changes
* Python Program to send slack message to a channel
* Slack Message Revision Changes
* Python Program to check Palindrome String
* Doctest Added
* Python Program to check whether a String is Panagram or not
* Python Program to check whether a String is Panagram or not
* Check Panagram Script Added
* Panagram Script Added
* Anagram Script Changes
* Anagram Alphabet Check Added
* Python Program to fetch github info
* fix: Syntax Error lgtm display in matrix/matrix_operation.py.
* Testing for None should use the 'is' operator.
* fix: Too many arguments for string format.
* fix: supress lgtm alert as false positive.
* style: Unnecessary 'pass' statement.
* Revert "fix: Syntax Error lgtm display in matrix/matrix_operation.py."
This reverts commit 4c629b4ce1.
* Added print function into matrix_multiplication_addition.py and removed blank space in data_structures/binary tree directory
* Removed .vs/ folder per #893
* Rename matrix_multiplication_addition.py to matrix_operation.py
* Unicode test on strings/rabin_karp.py per #1067
* Added matrix exponentiation approach for finding fibonacci number.
* Implemented the way of finding nth fibonacci.
* Complexity is about O(log(n)*8)
* Updated the matrix exponentiation approach of finding nth fibonacci.
- Removed some extra spaces
- Added the complexity of bruteforce algorithm
- Removed unused function called zerro()
- Added some docktest based on request
* Updated the matrix exponentiation approach of finding nth fibonacci.
- Removed some extra spaces
- Added the complexity of bruteforce algorithm
- Removed unused function called zerro()
- Added some docktest based on request
* Updated Rabin Karp algorithm.
- Previous solution is based on the hash function of python.
- Implemented ruling hash to get the appropriate complexity of rabin karp.
* Updated Rabin Karp algorithm.
- Previous solution is based on the hash function of python.
- Implemented ruling hash to get the appropriate complexity of rabin karp.
* Implemented ruling hash to appropriate complexity of Rabin Karp
Added unit pattern testing
