Given a sum, find two numbers in an array with that sum.

Question

Andy · Accepted Answer

Using JS:

nums = [2,13,61,512,3,6,7,88,17]

sum = 15

for(var i = 0; i  -1) {
    return nums[match];
  }
}

sidd · Answer

The other answer works, but is not efficient (It is O(n^2))

To make it O(n), simply make a hashmap. For every number, check to see if the number exists in the hashmap, otherwise store [sum-currentNumber]

Suraj Mishra · Answer

Please find the answer below which I compiled now,
//Php Program
$array = [3, 5, 2, -4, 8, 11];
$numberToSum = 7;
$length = count($array);
$arrayData = [];

for($j=0;$j<$length;$j++){
    for($i=$j+1;$i<$length;$i++){
        if($array[$j] + $array[$i] == $numberToSum){
            $arrayData[] = [$array[$j],$array[$i]];
        }
        
    }
    
}

print_r($arrayData);

Bloomberg

Bloomberg interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches