Edabit

Create a function that returns all pairs of numbers in an array that sum to a target. Sort the pairs in ascending order with respect to the smaller number, then order each pair in this order: [smaller, larger].

Examples

 allPairs([2, 4, 5, 3], 7) ➞ [[2, 5], [3, 4]] // 2 + 5 = 7, 3 + 4 = 7  allPairs([5, 3, 9, 2, 1], 3) ➞ [[1, 2]]  allPairs([4, 5, 1, 3, 6, 8], 9) ➞ [[1, 8], [3, 6], [4, 5]] // Sorted: 1 < 3 < 4; each pair is ordered [smaller, larger]

Notes

  • If no pairs are found, return an empty array [].
  • You are only allowed to use each number once in a pair.
  • See Comments for a hint.

Solution:

 1  2  3  4  5  6  7  8  9 10 11 12 13
 
function allPairs(arr, target) {   let sol = [];   for (let i = 0; i < arr.length - 1; i++) {     for (let j = i + 1; j < arr.length; j++) {       if (arr[i] + arr[j] === target) {         sol.push([Math.min(arr[i], arr[j]), Math.max(arr[i], arr[j])]); 				break;       }     }   }   sol.sort((a, b) => a[0] - b[0]);   return sol; }
This free site is ad-supported. Learn more
​