Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
Solution - Brute Force
var twoSum = function(nums, target) {
for(var i = 0; i < nums.length; i++) {
for(var j = i + 1; j < nums.length; j++) {
if(nums[j] == target - nums[i]) {
return [i, j]
}
}
}
throw new Error(`No two numbers such that they total-up to ${target}`);
};
console.log(twoSum([2,7,11,15], 9));
Finished
Runtime: 84 ms
Your input
[2,7,11,15]
9
9
stdout
[ 0, 1 ]
Output
[0,1]
Expected
[0,1]
Comments
Post a Comment