Maximizing Unique Pairs from two arrays
Last Updated :
19 Sep, 2023
Given two arrays of equal size N, form maximum number of pairs by using their elements, one from the first array and second from the second array, such that an element from each array is used at-most-once and the absolute difference between the selected elements used for forming a pair is less than or equal to a given element K.
Examples:
Input : a[] = {3, 4, 5, 2, 1}
b[] = {6, 5, 4, 7, 15}
k = 3
Output : 4
The maximum number of pairs that can be formed
using the above 2 arrays is 4 and the corresponding
pairs are [1, 4], [2, 5], [3, 6], [4, 7], we can't
pair the remaining elements.
Other way of pairing under given constraint is
[2, 5], [3, 6], [4, 4], but count of pairs here
is 3 which is less than the result 4.
Simple Approach: By taking few examples, we can observe that if we sort both arrays. Then one by picking the closest feasible element for every element, we get the optimal answer.
In this approach we first sort both the arrays and then compare each element of the first array with each element of the second array for the possible pair, if it's possible to form a pair, we form the pair and move to check for the next possible pair for the next element of the first array.
Implementation:
C++
// C++ implementation of above approach
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
ll findMaxPairs(ll a[], ll b[], ll n, ll k)
{
sort(a, a+n); // Sorting the first array.
sort(b, b+n); // Sorting the second array.
// To keep track of visited elements of b[]
bool flag[n];
memset(flag, false, sizeof(flag));
// For every element of a[], find a pair
// for it and break as soon as a pair is
// found.
int result = 0;
for (int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
{
if (abs(a[i]-b[j])<=k && flag[j]==false)
{
// Increasing the count if a pair is formed.
result++;
/* Making the corresponding flag array
element as 1 indicating the element
in the second array element has
been used. */
flag[j] = true;
// We break the loop to make sure an
// element of a[] is used only once.
break;
}
}
}
return result;
}
// Driver code
int main()
{
ll a[] = {10, 15, 20}, b[] = {17, 12, 24};
int n = sizeof(a)/sizeof(a[0]);
int k = 3;
cout << findMaxPairs(a, b, n, k);
return 0;
}
// Java implementation of above approach
import java.util.*;
class solution
{
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
static int findMaxPairs(int a[], int b[], int n, int k)
{
Arrays.sort(a); // Sorting the first array.
Arrays.sort(b); // Sorting the second array.
// To keep track of visited elements of b[]
boolean []flag = new boolean[n];
Arrays.fill(flag,false);
// For every element of a[], find a pair
// for it and break as soon as a pair is
// found.
int result = 0;
for (int i=0; i<n; i++)
{
for (int j=0; j<n; j++)
{
if (Math.abs(a[i]-b[j])<=k && flag[j]==false)
{
// Increasing the count if a pair is formed.
result++;
/* Making the corresponding flag array
element as 1 indicating the element
in the second array element has
been used. */
flag[j] = true;
// We break the loop to make sure an
// element of a[] is used only once.
break;
}
}
}
return result;
}
// Driver code
public static void main(String args[])
{
int[] a = {10, 15, 20};
int[] b = {17, 12, 24};
int n = a.length;
int k = 3;
System.out.println(findMaxPairs(a, b, n, k));
}
}
// This code is contributed by
// Shashank_Sharma
# Returns count of maximum pairs
# that can be formed from a[] and
# b[] under given constraints.
def findMaxPairs(a, b, n, k):
a.sort() # Sorting the first array.
b.sort() # Sorting the second array.
# To keep track of visited
# elements of b[]
flag = [False] * n
# For every element of a[], find
# a pair for it and break as soon
# as a pair is found.
result = 0
for i in range(n):
for j in range(n):
if (abs(a[i] - b[j]) <= k and
flag[j] == False):
# Increasing the count if
# a pair is formed.
result += 1
''' Making the corresponding flag array
element as 1 indicating the element
in the second array element has
been used. '''
flag[j] = True
# We break the loop to make sure an
# element of a[] is used only once.
break
return result
# Driver code
if __name__ == "__main__":
a = [10, 15, 20]
b = [17, 12, 24]
n = len(a)
k = 3
print(findMaxPairs(a, b, n, k))
# This code is contributed
# by ChitraNayal
// C# implementation of above approach
using System;
class GFG
{
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
static int findMaxPairs(int []a, int []b,
int n, int k)
{
Array.Sort(a); // Sorting the first array.
Array.Sort(b); // Sorting the second array.
// To keep track of visited elements of b[]
bool []flag = new bool[n];
//Arrays.fill(flag,false);
// For every element of a[], find a pair
// for it and break as soon as a pair is
// found.
int result = 0;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (Math.Abs(a[i] - b[j]) <= k && flag[j] == false)
{
// Increasing the count if a pair is formed.
result++;
/* Making the corresponding flag array
element as 1 indicating the element
in the second array element has
been used. */
flag[j] = true;
// We break the loop to make sure an
// element of a[] is used only once.
break;
}
}
}
return result;
}
// Driver code
public static void Main()
{
int[] a = {10, 15, 20};
int[] b = {17, 12, 24};
int n = a.Length;
int k = 3;
Console.WriteLine(findMaxPairs(a, b, n, k));
}
}
// This code is contributed by Rajput-Ji
<script>
// Javascript implementation of above approach
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
function findMaxPairs(a,b,n,k)
{
a.sort(function(c,d){return c-d;}); // Sorting the first array.
b.sort(function(c,d){return c-d;}) // Sorting the second array.
// To keep track of visited elements of b[]
let flag = new Array(n);
for(let i=0;i<flag.length;i++)
{
flag[i]=false;
}
// For every element of a[], find a pair
// for it and break as soon as a pair is
// found.
let result = 0;
for (let i=0; i<n; i++)
{
for (let j=0; j<n; j++)
{
if (Math.abs(a[i]-b[j])<=k && flag[j]==false)
{
// Increasing the count if a pair is formed.
result++;
/* Making the corresponding flag array
element as 1 indicating the element
in the second array element has
been used. */
flag[j] = true;
// We break the loop to make sure an
// element of a[] is used only once.
break;
}
}
}
return result;
}
// Driver code
let a=[10, 15, 20];
let b=[17, 12, 24];
let n = a.length;
let k = 3;
document.write(findMaxPairs(a, b, n, k));
// This code is contributed by rag2127
</script>
Time complexity : O(n2)
Auxiliary Space : O(n)
Efficient Approach: In this approach, rather than checking all the possible combinations of pairs, we optimize our code by checking only the feasible combination of pairs using the 2 pointer approach.
Implementation:
C++
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
ll findMaxPairs(ll a[], ll b[], ll n, ll k)
{
sort(a, a+n); // Sorting the first array.
sort(b, b+n); // Sorting the second array.
int result = 0;
for (int i=0, j=0; i<n && j<n;)
{
if (abs(a[i] - b[j]) <= k)
{
result++;
// Increasing array pointer of
// both the first and the second array.
i++;
j++;
}
// Increasing array pointer of the second array.
else if(a[i] > b[j])
j++;
// Increasing array pointer of the first array.
else
i++;
}
return result;
}
// Driver code
int main()
{
ll a[] = {10, 15, 20};
ll b[] = {17, 12, 24};
int n = sizeof(a)/sizeof(a[0]);
int k = 3;
cout << findMaxPairs(a, b, n, k);
return 0;
}
// Java program for Maximizing Unique Pairs
// from two arrays
import java.util.*;
class GFG
{
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
static int findMaxPairs(int a[], int b[],
int n, int k)
{
Arrays.sort(a); // Sorting the first array.
Arrays.sort(b); // Sorting the second array.
int result = 0;
for (int i = 0, j = 0; i < n && j < n;)
{
if (Math.abs(a[i] - b[j]) <= k)
{
result++;
// Increasing array pointer of
// both the first and the second array.
i++;
j++;
}
// Increasing array pointer
// of the second array.
else if(a[i] > b[j])
j++;
// Increasing array pointer
// of the first array.
else
i++;
}
return result;
}
// Driver code
public static void main(String args[])
{
int a[] = {10, 15, 20};
int b[] = {17, 12, 24};
int n = a.length;
int k = 3;
System.out.println(findMaxPairs(a, b, n, k));
}
}
// This code is contributed by
// Sanjit_Prasad
# Python3 program for
# Maximizing Unique Pairs
# from two arrays
# Returns count of maximum pairs that can
# be formed from a[] and b[] under given
# constraints.
def findMaxPairs(a,b,n,k):
# Sorting the first array.
a.sort()
# Sorting the second array.
b.sort()
result =0
j=0
for i in range(n):
if j<n:
if abs(a[i]-b[j])<=k:
result+=1
# Increasing array pointer of
# both the first and the second array.
j +=1
# Increasing array pointer of
# the second array.
elif a[i]>b[j]:
j+=1
return result
# Driver code
if __name__=='__main__':
a = [10,15,20]
b = [17,12,24]
n = len(a)
k =3
print(findMaxPairs(a,b,n,k))
# This code is contributed by
# Shrikant13
// C# program for Maximizing Unique Pairs
// from two arrays
using System;
class GFG
{
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
static int findMaxPairs(int []a, int []b,
int n, int k)
{
Array.Sort(a); // Sorting the first array.
Array.Sort(b); // Sorting the second array.
int result = 0;
for (int i = 0, j = 0; i < n && j < n;)
{
if (Math.Abs(a[i] - b[j]) <= k)
{
result++;
// Increasing array pointer of
// both the first and the second array.
i++;
j++;
}
// Increasing array pointer
// of the second array.
else if(a[i] > b[j])
j++;
// Increasing array pointer
// of the first array.
else
i++;
}
return result;
}
// Driver code
public static void Main(String []args)
{
int []a = {10, 15, 20};
int []b = {17, 12, 24};
int n = a.Length;
int k = 3;
Console.WriteLine(findMaxPairs(a, b, n, k));
}
}
// This code has been contributed by 29AjayKumar
<script>
// Javascript program for Maximizing
// Unique Pairs from two arrays
// Returns count of maximum pairs that can
// be formed from a[] and b[] under given
// constraints.
function findMaxPairs(a, b, n, k)
{
// Sorting the first array.
a.sort(function(a, b){return a - b});
// Sorting the second array.
b.sort(function(a, b){return a - b});
let result = 0;
for (let i = 0, j = 0; i < n && j < n;)
{
if (Math.abs(a[i] - b[j]) <= k)
{
result++;
// Increasing array pointer of
// both the first and the second array.
i++;
j++;
}
// Increasing array pointer
// of the second array.
else if(a[i] > b[j])
j++;
// Increasing array pointer
// of the first array.
else
i++;
}
return result;
}
let a = [10, 15, 20];
let b = [17, 12, 24];
let n = a.length;
let k = 3;
document.write(findMaxPairs(a, b, n, k));
</script>
Time complexity : O(n Log n)
Auxiliary Space : O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem