Remove minimum elements such that no common elements exist in two arrays
Last Updated :
24 Feb, 2025
Given two arrays arr1[] and arr2[] consisting of n and m elements respectively. The task is to find the minimum number of elements to remove from each array such that intersection of both arrays becomes empty and both arrays become mutually exclusive.
Examples:
Input: arr[] = { 1, 2, 3, 4}, arr2[] = { 2, 3, 4, 5, 8 }
Output: 3
Explanation: We need to remove 2, 3 and 4 from any array.
Input: arr[] = { 4, 2, 4, 4}, arr2[] = { 4, 3 }
Output: 1
Explanation: We need to remove 4 from arr2[]
Input : arr[] = { 1, 2, 3, 4 }, arr2[] = { 5, 6, 7 }
Output : 0
Explanation: There is no common element in both.
Using Two Maps - O(n+m) Time and O(n+m) Space
The idea is to use Hashing We first count the frequency of each element in both arrays using two map data structures. After counting, iterates through all elements in the first map (countA). For each element that appears in both maps, adds the minimum frequency of that element in both arrays to a result variable (res). This sum represents the minimum number of removals required to remove all common elements between the two arrays.
Below is the implementation of the above approach:
C++
// CPP program to find minimum element to remove so no common element
// exist in both array
#include <bits/stdc++.h>
using namespace std;
// To find no elements to remove
// so no common element exist
int minRemove(vector<int>& arr1, vector<int>& arr2)
{
// To store count of array elements
unordered_map<int, int> countA, countB;
// Count elements of arr1
for (int i = 0; i < arr1.size(); i++)
countA[arr1[i]]++;
// Count elements of arr2
for (int i = 0; i < arr2.size(); i++)
countB[arr2[i]]++;
// Traverse through all common elements, and
// pick minimum occurrence from two arrays
int res = 0;
for (auto x : countA)
if (countB.find(x.first) != countB.end())
res += min(x.second, countB[x.first]);
// To return count of minimum elements
return res;
}
int main()
{
vector<int> arr1 = { 1, 2, 3, 4 };
vector<int> arr2 = { 2, 3, 4, 5, 8 };
cout << minRemove(arr1, arr2);
return 0;
}
// Java Code to Remove minimum number of elements
// such that no common element exist in both array
import java.util.HashMap;
class GfG {
static int minRemove(int[] arr1, int[] arr2) {
HashMap<Integer, Integer> countA = new HashMap<>();
HashMap<Integer, Integer> countB = new HashMap<>();
int res = 0;
// Count elements of arr1
for (int num : arr1) {
countA.put(num, countA.getOrDefault(num, 0) + 1);
}
// Count elements of arr2
for (int num : arr2) {
countB.put(num, countB.getOrDefault(num, 0) + 1);
}
// Traverse through all common elements, and pick minimum
// occurrence from two arrays
for (int key : countA.keySet()) {
if (countB.containsKey(key)) {
res += Math.min(countA.get(key), countB.get(key));
}
}
return res;
}
public static void main(String[] args) {
int[] arr1 = {1, 2, 3, 4};
int[] arr2 = {2, 3, 4, 5, 8};
System.out.println(minRemove(arr1, arr2));
}
}
# Python3 program to find minimum element to remove so no common
# element exist in both array
from collections import Counter
def minRemove(arr1, arr2):
countA = Counter(arr1)
countB = Counter(arr2)
res = 0
# Traverse through all common elements, and pick minimum
# occurrence from two arrays
for key in countA:
if key in countB:
res += min(countA[key], countB[key])
return res
arr1 = [1, 2, 3, 4]
arr2 = [2, 3, 4, 5, 8]
print(minRemove(arr1, arr2))
// C# Code to Remove minimum number of elements
// such that no common element exist in both array
using System;
using System.Collections.Generic;
class GfG
{
static int MinRemove(int[] arr1, int[] arr2)
{
Dictionary<int, int> countA = new Dictionary<int, int>();
Dictionary<int, int> countB = new Dictionary<int, int>();
int res = 0;
// Count elements of arr1
foreach (int num in arr1)
{
if (countA.ContainsKey(num))
countA[num]++;
else
countA[num] = 1;
}
// Count elements of arr2
foreach (int num in arr2)
{
if (countB.ContainsKey(num))
countB[num]++;
else
countB[num] = 1;
}
// Traverse through all common elements, and pick minimum
// occurrence from two arrays
foreach (var key in countA.Keys)
{
if (countB.ContainsKey(key))
{
res += Math.Min(countA[key], countB[key]);
}
}
return res;
}
static void Main(string[] args)
{
int[] arr1 = { 1, 2, 3, 4 };
int[] arr2 = { 2, 3, 4, 5, 8 };
Console.WriteLine(MinRemove(arr1, arr2));
}
}
// Javascript program to find minimum element to remove
// so no common element exist in both array
function minRemove(arr1, arr2) {
let countA = {};
let countB = {};
let res = 0;
// Count elements of arr1
for (let num of arr1) {
countA[num] = (countA[num] || 0) + 1;
}
// Count elements of arr2
for (let num of arr2) {
countB[num] = (countB[num] || 0) + 1;
}
// Traverse through all common elements, and pick minimum
// occurrence from two arrays
for (let key in countA) {
if (countB.hasOwnProperty(key)) {
res += Math.min(countA[key], countB[key]);
}
}
return res;
}
const arr1 = [1, 2, 3, 4];
const arr2 = [2, 3, 4, 5, 8];
console.log(minRemove(arr1, arr2));
Time Complexity: O(n+m), where m and n are the length of arr1 and arr2 respectively
Auxiliary Space: O(n+m), For storing the frequency in map for both the arrays
Using Single Map - O(n+m) Time and O(n) Space
The idea is to count occurrences of elements from arr1 using a single map. Then, while iterating through arr2, we check for common elements and decrement their count, adding to the result. One map is enough because we only need to track elements from arr1 and check for their existence in arr2, avoiding redundant storage.
Below is the implementation of the above approach:
C++
// CPP program to find minimum elements to remove
// so no common element exists in both arrays using a single map
#include <bits/stdc++.h>
using namespace std;
int minRemove(vector<int>& arr1, vector<int>& arr2) {
unordered_map<int, int> count;
// Count elements of arr1
for (int x : arr1) {
count[x] += 1;
}
int res = 0;
// Count elements of arr2 and check common elements
for (int x : arr2) {
if (count.find(x) != count.end() && count[x] > 0) {
count[x]--;
res++;
}
}
return res;
}
int main() {
vector<int> arr1 = {1, 2, 3, 4};
vector<int> arr2 = {2, 3, 4, 5, 8};
cout << minRemove(arr1, arr2);
return 0;
}
// Java program to find minimum elements to remove
// so no common element exists in both arrays using a single map
import java.util.HashMap;
class GfG {
static int minRemove(int[] arr1, int[] arr2) {
HashMap<Integer, Integer> count = new HashMap<>();
int res = 0;
// Count elements of arr1
for (int num : arr1) {
count.put(num, count.getOrDefault(num, 0) + 1);
}
// Count elements of arr2 and check common elements
for (int num : arr2) {
if (count.containsKey(num) && count.get(num) > 0) {
count.put(num, count.get(num) - 1);
res++;
}
}
return res;
}
public static void main(String[] args) {
int[] arr1 = {1, 2, 3, 4};
int[] arr2 = {2, 3, 4, 5, 8};
System.out.println(minRemove(arr1, arr2));
}
}
# Python3 program to find minimum elements to remove
# so no common element exists in both arrays using a single map
from collections import Counter
def minRemove(arr1, arr2):
count = Counter(arr1)
res = 0
# Count elements of arr2 and check common elements
for num in arr2:
if count[num] > 0:
count[num] -= 1
res += 1
return res
arr1 = [1, 2, 3, 4]
arr2 = [2, 3, 4, 5, 8]
print(minRemove(arr1, arr2))
// C# program to find minimum elements to remove
// so no common element exists in both arrays using a single map
using System;
using System.Collections.Generic;
class GfG
{
static int MinRemove(int[] arr1, int[] arr2)
{
Dictionary<int, int> count = new Dictionary<int, int>();
int res = 0;
// Count elements of arr1
foreach (int num in arr1)
{
if (count.ContainsKey(num))
count[num]++;
else
count[num] = 1;
}
// Count elements of arr2 and check common elements
foreach (int num in arr2)
{
if (count.ContainsKey(num) && count[num] > 0)
{
count[num]--;
res++;
}
}
return res;
}
static void Main(string[] args)
{
int[] arr1 = { 1, 2, 3, 4 };
int[] arr2 = { 2, 3, 4, 5, 8 };
Console.WriteLine(MinRemove(arr1, arr2));
}
}
// Javascript program to find minimum elements to remove
// so no common element exists in both arrays using a single map
function minRemove(arr1, arr2) {
let count = {};
let res = 0;
// Count elements of arr1
for (let num of arr1) {
count[num] = (count[num] || 0) + 1;
}
// Count elements of arr2 and check common elements
for (let num of arr2) {
if (count[num] && count[num] > 0) {
count[num]--;
res++;
}
}
return res;
}
const arr1 = [1, 2, 3, 4];
const arr2 = [2, 3, 4, 5, 8];
console.log(minRemove(arr1, arr2));
Time Complexity: O(n+m), where m and n are the length of arr1 and arr2 respectively
Auxiliary Space: O(n), as we use a map to store elements of arr1.
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