* 📦 NEW: Added solution for ProjectEuler-007
* 🐛 FIX: Spelling mistake fixes
* 👌 IMPROVE: changed variable name from `inc` to `candidateValue` and thrown error in case of invalid input
* 👌 IMPROVE: Modified the code
* 👌 IMPROVE: Added test case for ProjectEuler Problem001
Co-authored-by: Omkarnath Parida <omkarnath.parida@yocket.in>
* feat: Add check number case
* style: Fix formatting
* fix: Remove number check part
* feat: Create isPalindromeIntegerNumber
* test: Add minus number case
* [CREATE] Problem 044 from Project Euler
* [UPDATE] Code styling update
* [UPDATE] Change return condition, added an input for main function,
added tests for problem 44
* [UPDATE] minor styling fixes to standard javascript
* [UPDATE] Fix parentheses in main function return
* 📦 NEW: Added solution for ProjectEuler-007
* 🐛 FIX: Spelling mistake fixes
* 👌 IMPROVE: changed variable name from `inc` to `candidateValue` and thrown error in case of invalid input
* 👌 IMPROVE: Modified the code
Co-authored-by: Omkarnath Parida <omkarnath.parida@yocket.in>
* Add an algorithm to find length and area of an arc of a circle
* Updated to follow Javascript Standard Style
* Update CircularArc.js
* Update CircularArc.js
* Add tests
* Followed Javascript standard style
* Bugfix AVLTree comparator
The original insertBalance function was doing raw value comparisons as opposed to using the tree's comparator. This is clearly unintentional, and would (ultimately) cause the structure to segfault when constructed with the stringData included in the updated test.
I've added the fix, scanned the rest of the code for similar issues, and added the appropriate test case which passes successfully with the fix. The jest code coverage increases slightly as well with the changes.
* 100% jest code coverage
Added a couple of extra elements to the original test tree, and then removed elements in an order such that all previously uncovered branches of code are now covered.
Also added an emptyTree structure to test some additional (trivial) base cases.
* standard style fix
missed this from my previous commit
* Iterative & in-place BFS
An iterative analog to the traditional recursive breadth-first-search algorithm for binary trees.
This in-place solution uses the pre-existing "traversal" array for both tracking the algorithm as well as storing the result.
Also tweaked old code by resetting the traversal array each time the tree is traversed (otherwise you're only allowed to traverse a tree once which doesn't seem correct even with a single traversal function).
* Update BreadthFirstTreeTraversal.js
got rid of unnecessary currentSize
added currentNode for clarity
* refactor out traversal member var
.. per earlier discussion w mods
also tweaked the tests to achieve 100% coverage
* Bugfix AVLTree comparator
The original insertBalance function was doing raw value comparisons as opposed to using the tree's comparator. This is clearly unintentional, and would (ultimately) cause the structure to segfault when constructed with the stringData included in the updated test.
I've added the fix, scanned the rest of the code for similar issues, and added the appropriate test case which passes successfully with the fix. The jest code coverage increases slightly as well with the changes.
* 100% jest code coverage
Added a couple of extra elements to the original test tree, and then removed elements in an order such that all previously uncovered branches of code are now covered.
Also added an emptyTree structure to test some additional (trivial) base cases.
* standard style fix
missed this from my previous commit
* Iterative & in-place BFS
An iterative analog to the traditional recursive breadth-first-search algorithm for binary trees.
This in-place solution uses the pre-existing "traversal" array for both tracking the algorithm as well as storing the result.
Also tweaked old code by resetting the traversal array each time the tree is traversed (otherwise you're only allowed to traverse a tree once which doesn't seem correct even with a single traversal function).
* Update BreadthFirstTreeTraversal.js
got rid of unnecessary currentSize
added currentNode for clarity
