Javascript Program for Find k pairs with smallest sums in two arrays

Javascript Program to Count pairs with given sum

Last Updated : 14 Feb, 2025

Given an array of integers, and a number ‘sum’, find the number of pairs of integers in the array whose sum is equal to ‘sum’.
Note: Duplicate pairs are also allowed.

Examples:

Input  :  arr[] = {1, 5, 7, -1}, 
          sum = 6
Output :  2
Pairs with sum 6 are (1, 5) and (7, -1)

Input  :  arr[] = {1, 5, 7, -1, 5}, 
          sum = 6
Output :  3
Pairs with sum 6 are (1, 5), (7, -1) &
                     (1, 5)         

Input  :  arr[] = {1, 1, 1, 1}, 
          sum = 2
Output :  6
There are 3! pairs with sum 2.

Input  :  arr[] = {10, 12, 10, 15, -1, 7, 6, 
                   5, 4, 2, 1, 1, 1}, 
          sum = 11
Output :  9

Expected time complexity O(n)

Naive Solution :

A simple solution is to traverse each element and check if there’s another number in the array which can be added to it to give sum.

JavaScript

// Javascript implementation of simple method to find count of
// pairs with given sum.

// Returns number of pairs in arr[0..n-1] with sum equal
// to 'sum'
function getPairsCount(arr, n, sum) {
    let count = 0; // Initialize result

    // Consider all possible pairs and check their sums
    for (let i = 0; i < n; i++)
        for (let j = i + 1; j < n; j++)
            if (arr[i] + arr[j] == sum)
                count++;

    return count;
}

// Driver function to test the above function
let arr = [1, 5, 7, -1, 5];
let n = arr.length;
let sum = 6;
console.log("Count of pairs is " + getPairsCount(arr, n, sum));

// This code is contributed by Mayank Tyagi

Output

Count of pairs is 3

Complexity Analysis:

Time Complexity: O(n²)
Auxiliary Space: O(1)

Please refer complete article on Count pairs with given sum for more details!

Javascript Program for Find k pairs with smallest sums in two arrays

kartik

Improve

Article Tags :

Practice Tags :

Similar Reads

Javascript Program to Find a pair with the given difference

Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples: Input: arr[] = {5, 20, 3, 2, 50, 80}, n = 78Output: Pair Found: (2, 80)Input: arr[] = {90, 70, 20, 80, 50}, n = 45Output: No Such PairNative Approach:The simplest method is t

Javascript Program for Find k pairs with smallest sums in two arrays

Given two integer arrays arr1[] and arr2[] sorted in ascending order and an integer k. Find k pairs with smallest sums such that one element of a pair belongs to arr1[] and other element belongs to arr2[] Examples: Input : arr1[] = {1, 7, 11} arr2[] = {2, 4, 6} k = 3Output : [1, 2], [1, 4], [1, 6]Ex

Count pairs with given sum

Given an array arr[] of n integers and a target value, the task is to find the number of pairs of integers in the array whose sum is equal to target. Examples: Input: arr[] = {1, 5, 7, -1, 5}, target = 6Output: 3Explanation: Pairs with sum 6 are (1, 5), (7, -1) & (1, 5). Input: arr[] = {1, 1, 1,

Javascript Program to Count triplets with sum smaller than a given value

Given an array of distinct integers and a sum value. Find the count of triplets with a sum smaller than the given sum value. The expected Time Complexity is O(n2). Examples: Input : arr[] = {-2, 0, 1, 3} sum = 2. Output : 2 Explanation : Below are triplets with sum less than 2 (-2, 0, 1) and (-2, 0,

Javascript Program for Number of pairs with maximum sum

Write a javascript program for a given array arr[], count the number of pairs arr[i], arr[j] such that arr[i] + arr[j] is maximum and i < j. Example: Input : arr[] = {1, 1, 1, 2, 2, 2}Output: 3Explanation: The maximum possible pair sum where i<j is 4, which is given by 3 pairs, so the answer i

2 Sum - Count Pairs with given Sum in Sorted Array

Given a sorted array arr[] and an integer target, the task is to find the number of pairs in the array whose sum is equal to target. Examples: Input: arr[] = [-1, 1, 5, 5, 7], target = 6Output: 3Explanation: Pairs with sum 6 are (1, 5), (1, 5) and (-1, 7). Input: arr[] = [1, 1, 1, 1], target = 2Outp

Count Pairs from two arrays with even sum

Given two arrays A[] and B[] of N and M integers respectively. The task is to count the number of unordered pairs formed by choosing an element from array A[] and other from array B[] in such a way that their sum is an even number. Note that an element will only be a part of a single pair.Examples:

Count of Fibonacci pairs with sum N in range 0 to N

Given a number N, the task is to find the count of Fibonacci pairs in range 0 to N whose sum is N. Examples: Input: N = 90 Output: 1 Explanation: Only Fibonacci pair in range [0, 90] whose sum is equal to 90 is {1, 89} Input: N = 3 Output: 2 Explanation: Fibonacci Pair in range [0, 3] with whose sum

2 Sum - Count distinct pairs with given sum

Given an array arr[] of size n and an integer target, the task is to count the number of distinct pairs in the array whose sum is equal to target. Examples: Input: arr[] = { 5, 6, 5, 7, 7, 8 }, target = 13 Output: 2 Explanation: Distinct pairs with sum equal to 13 are (5, 8) and (6, 7). Input: arr[]

Maximum count of pairs which generate the same sum

Given an array arr[], the task is to count the maximum count of pairs that give the same sum. Examples: Input: arr[] = {1, 2, 3, 4} Output: 2 (1, 2) = 3 (1, 3) = 4 (1, 4), (2 + 3) = 5 (2, 4) = 6 (3, 4) = 7 Input: arr[] = {1, 8, 3, 11, 4, 9, 2, 7} Output: 3 Approach: Create a map to store the frequen