There no such a big problem now, it just my opinion,
but as suggested my friend anyway, it's better using new Map || new Set for better performance.
new Map || new Set
jsperf.com/hashtable-vs-array
Here is my O(N) solution using Set:
function doTwoNumbersSumUpToK(list, k) { const visitedNumbers = new Set(); for (let number of list) { visitedNumbers.add(number); if (visitedNumbers.has(k-number)) { return true; } } return false; }
You should move line: visitedNumbers.add(number);
after the if clause (otherwise the sums like 4+4=8 will be counted)
A compare i made for the Set vs HashTable jsperf.com/add-to-k
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
There no such a big problem now,
it just my opinion,
but as suggested my friend
anyway, it's better using
new Map || new Setfor better performance.jsperf.com/hashtable-vs-array
Here is my O(N) solution using Set:
You should move line:
visitedNumbers.add(number);
after the if clause (otherwise the sums like 4+4=8 will be counted)
A compare i made for the Set vs HashTable
jsperf.com/add-to-k