We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 50115f9 commit 5aab5ccCopy full SHA for 5aab5cc
src/_Problems_/find-2-nums-adding-to-n/index.js
@@ -4,7 +4,7 @@ function findTwoNumsAddingToN(arr, number) {
4
const store = new Set();
5
6
for (let i = 0; i < arr.length; i += 1) {
7
- // check if the set contains one of the pair that sum upto given number
+ // check if the set contains one of the element that sum upto the given number
8
if (store.has(number - arr[i])) {
9
pair.push(number - arr[i]);
10
pair.push(arr[i]);
0 commit comments