From 3e24a7a22726cb2afed1a8590eb7c1f5685b5915 Mon Sep 17 00:00:00 2001 From: Chinedu Abalogu Date: Thu, 15 Sep 2022 11:31:06 +0100 Subject: [PATCH 1/2] optimising find pair first approach --- arrays/find-pair/second-approach.js | 1 + 1 file changed, 1 insertion(+) create mode 100644 arrays/find-pair/second-approach.js diff --git a/arrays/find-pair/second-approach.js b/arrays/find-pair/second-approach.js new file mode 100644 index 0000000..d17dd38 --- /dev/null +++ b/arrays/find-pair/second-approach.js @@ -0,0 +1 @@ +// to write optimised approach From 4104091f1db22cf0a1618a85f88875f1723f3e21 Mon Sep 17 00:00:00 2001 From: Chinedu Abalogu Date: Mon, 19 Sep 2022 17:15:34 +0100 Subject: [PATCH 2/2] using a hashset --- arrays/find-pair/second-approach.js | 17 ++++++++++++++++- 1 file changed, 16 insertions(+), 1 deletion(-) diff --git a/arrays/find-pair/second-approach.js b/arrays/find-pair/second-approach.js index d17dd38..ad105ce 100644 --- a/arrays/find-pair/second-approach.js +++ b/arrays/find-pair/second-approach.js @@ -1 +1,16 @@ -// to write optimised approach +let findSumOfTwo = function (nums, val) { + let set = new Set(); + + for (let item of nums) { + console.log(item); + if (set.has(val - item)) { + return true; + } + + set.add(item); + } + + return false; +}; + +console.log(findSumOfTwo([2, 1, 8, 4, 7, 3], 3));