
- Javascript Basics Tutorial
- Javascript - Home
- Javascript - Overview
- Javascript - Syntax
- Javascript - Enabling
- Javascript - Placement
- Javascript - Variables
- Javascript - Operators
- Javascript - If...Else
- Javascript - Switch Case
- Javascript - While Loop
- Javascript - For Loop
- Javascript - For...in
- Javascript - Loop Control
- Javascript - Functions
- Javascript - Events
- Javascript - Cookies
- Javascript - Page Redirect
- Javascript - Dialog Boxes
- Javascript - Void Keyword
- Javascript - Page Printing
- JavaScript Objects
- Javascript - Objects
- Javascript - Number
- Javascript - Boolean
- Javascript - Strings
- Javascript - Arrays
- Javascript - Date
- Javascript - Math
- Javascript - RegExp
- Javascript - HTML DOM
- JavaScript Advanced
- Javascript - Error Handling
- Javascript - Validations
- Javascript - Animation
- Javascript - Multimedia
- Javascript - Debugging
- Javascript - Image Map
- Javascript - Browsers
- JavaScript Useful Resources
- Javascript - Questions And Answers
- Javascript - Quick Guide
- Javascript - Functions
- Javascript - Resources
Pair whose sum exists in the array in JavaScript
We are required to write a JavaScript function that takes in an array of Numbers. The function should pick a pair of two numbers which are at different indices (consecutive or nonconsecutive) whose sum also exists in the array.
Example
Following is the code −
const arr = [1, 3, 5, 6, 8, 9]; const findPair = (arr = []) => { let count = 0; for(let i = 0; i < arr.length; i++){ for(let j = 0; j < arr.length; j++){ if(i === j){ break; }; let sum = arr[i] + arr[j]; if(arr.includes(sum)){ return [arr[i], arr[j]]; }; }; }; return []; }; console.log(findPair(arr));
Output
Following is the output on console −
[5, 1]
- Related Articles
- Pair of (adjacent) elements of an array whose sum is lowest JavaScript
- Count number of distinct pairs whose sum exists in the given array in C++
- Write:(a) a pair of integers whose sum is $-8$.(b) a pair of integers whose difference is \( -12 \).(c) a pair of integers whose sum is $0$
- Achieving maximum possible pair sum in JavaScript
- Find the largest pair sum in an unsorted array in C++
- Write a pair of integers whose sum is 7.
- Adjacent elements of array whose sum is closest to 0 - JavaScript
- Find required sum pair with JavaScript
- How to find a group of three elements in an array whose sum equals some target sum JavaScript
- Finding matching pair from an array in JavaScript
- Consecutive elements sum array in JavaScript
- Recursion - Sum Nested Array in JavaScript
- Best way to find two numbers in an array whose sum is a specific number with JavaScript?
- Count pairs in array whose sum is divisible by K in C++
- Count pairs in array whose sum is divisible by 4 in C++

Advertisements