Return whether any two sums to k

JavaScript
1

For example, given [3, 1, 3, 7] and k of 10, return true since 3 + 7 is 10

function toSum(nums, k){
    
    for(var i = 0; i < nums.length - 2; i++){
       for(var j = i + 1; j < nums.length - 1; j++){
           if(nums[j] + nums[i] === k){
               return true;
           }
           else 
                return false;
       }
    }
}

toSum([3, 1, 3, 7], 10);

what is an error…:thinking:

3

thank you sir,
problem is solved :smile:

4 
function toSum(nums, k){
    var result = '';
    for(var i = 0; i < nums.length - 1; i++){
       for(var j = i + 1; j < nums.length; j++){
           if(nums[j] + nums[i] === k){
               return   'true';
           }
           else 
            result = 'false';
       }
    }
    return result;
}

toSum([5, 1, 3, 4], 2);
6

sir, you are right…:+1:t2:

7

and use array.filter function when false or reduce when true?

1 Like