javascript-datastructures-algorithms

javascript-datastructures-algorithms copied to clipboard

https://github.com/loiane/javascript-datastructures-algorithms/blob/main/src/ts/data-structures/hash-table-linear-probing.ts#L45-L61 In the implementation of the `get` function, the returned value is not the correct index found by the while loop, instead of the original index. As a result, the...

Yamiqu

Yamiqu

Chapter 10, about Trees. This internal link is broken and I haven't found the **chapter 10** folder inside the examples folder. This is the broken path: _javascript-datastructures-algorithms/tree/third-edition/examples/_**chapter10**

sojinsamuel

Hi, @loiane I found an unexpected result of Kruskal for getting MST. see https://github.com/loiane/javascript-datastructures-algorithms/blob/main/examples/chapter12/07-Kruskal.js#L18 When running the code above, the return value is `[2, 2, 4, 2, 2]` instead of...

tequ1lAneio

Bumps [terser](https://github.com/terser/terser) from 4.8.0 to 4.8.1. Changelog Sourced from terser's changelog. v4.8.1 (backport) Security fix for RegExps that should not be evaluated (regexp DDOS) Commits See full diff in compare...

dependabot[bot]

It is a good way to patition a deduplicated array , but if the unsorted array is `[1,2,3,4,4,4,2,4,4,6,7]`, the function can't move `2` to front. I'd like to write a...

SikyChen

I guess there is a minor error, in the dynamic programming for min coin change in chapter 14, in the function makeChange there is a for block: ``` for (let...

aldendmw

Bumps [mixin-deep](https://github.com/jonschlinkert/mixin-deep) from 1.3.1 to 1.3.2. Commits 754f0c2 1.3.2 90ee1fa ensure keys are valid when mixing in values See full diff in compare view Maintainer changes This version was pushed...

dependabot[bot]

hey @loiane , just noticed the examples of chapter 10 are actually chapter 11's, could you help to add them back? thanks

Jeffzholy

Hongcheng1997