* chore: ignore .DS_Store in git (#65)

* Fix BST removal method.

* Simplify combineWithoutRepetition algorithm.

* add recursive solution to permutations with repetitions problem (#52)

* add recursive solution to permutations with repetitions problem

* fix untested function, failing test

* add comments

* Add recursive way of generating permutations with repetitions.

* Code style fixes.

* Update javascript-algorithms-and-data-structures version.

* fix unbound knapsack problem with items more than 1(default value) (#73)

* Code style fixes.

* Correct a comment (#66)

* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Add algorithms complexity to README.

* Update README.

* Z algorithm implementation (#77)

* Implemented Z algorithm

* Fixed bugs in implementation and added tests

* Added README explaining z algorithm

* Code style fixes.

* Add comments.

* Add comments.

* Fix BST removal method (#74)

* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Add setValue and nodeCopy methods to binary tree node.

* Corrected explanations and included an example (#75)

* Update README for integer partition.

* Added Complexity of Each Algorithm in Sorting/ directory. (#76)

* Added Complexity to Bubble Sort README.md

* Added Complexity to Counting-Sort README.md

* Italicized n in Bubble Sort README.md

* Added Complexity to Heap Sort README.md

* Added Complexity to Insertion Sort README.md

* Added Complexity to Merge Sort README.md

* Added Complexity to Quick Sort README.md

* Added Complexity to Radix Sort README.md

* Added Complexity to Selection Sort README.md

* Added Complexity to SHell Sort README.md

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Update READMEs.

* Add Levenshtein Distance algorithm explanations.

*  Fix the findEdge method of the graph (#80)

* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Fix the findEdge method of the graph

* Code style fix.

* Add regular expression matching algorithm.

* Fix the value returned by DisjointSet union (#81)

* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Fix the findEdge method of the graph

* Fix the value returned by DisjointSet union

* Add bit manipulation section.

* Add more bit manipulation functions.

* Add more bit manipulation functions.

* Fix typo.

* Simplify combineWithoutRepetitions function.

* Simplify combineWithRepetitions function.

* Add recursive factorial function (#85)

* Fix LinkedList

* Fix the prepend method for the LinkedList

* Fix the remove method for the MinHeap

* Correct a comment

* Fix BST removal method

* Fix the findEdge method of the graph

* Fix the value returned by DisjointSet union

* Add recursive factorial function

* Simplify permutateWithRepetitions algorithm.

…orithms