Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
Implemented Partition Problem, Recursive problem (#1582)
* Add Tug of War solution using backtracking
* Updated Documentation in README.md
* Added Tug of war problem link
* Updated Documentation in README.md
* Updated Documentation in README.md
* Refactor tugOfWar: remove unused vars, optimize initialization, and remove redundant checks
* Added Function Export Statment
* Updated Documentation in README.md
* Resolved Code Style --Prettier
* Rename "backtrack" to "recurse"
* Fix test case: The difference needs to be exactly 1.
* Code Modification: subsets should have sizes as close to n/2 as possible
* Updated test-case of TugOfWar
* Changed TugOfWar problem to Partition
* Modified partition problem
* Updated Documentation in README.md
* fixed code style
---------
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com> V
Vedas Dixit committed
e9e3ea4684332263fa7afbdd0e18780158888e7d
Parent: a044c57
Committed by GitHub <noreply@github.com>
on 11/15/2023, 1:52:57 PM