Length of array pair formed where one contains all distinct elements and other all same elements

Given an array arr[], the task is to determine the maximum possible size of two arrays of the same size that can be created using the given array elements such that in one array all the elements are distinct and in the other, all elements are the same.

Note: It is not mandatory to use all the elements of the given array to build the two arrays.

Examples:

Input: a[] = { 4, 2, 4, 1, 4, 3, 4 }
Output: 3
Explanation:
The maximum possible size would be 3 – {1 2 3} and {4 4 4}

Input: a[] = { 2, 1, 5, 4, 3 }
Output: 1
Explanation:
The maximum possible size would be 1 – {1} and {2}



Approach: To solve the problem mentioned above follow the steps given below:

Below is the implementation of above approach:

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation to Divide the array
// into two arrays having same size,
// one with distinct elements
// and other with same elements
  
#include <bits/stdc++.h>
using namespace std;
  
// Function to find the max size possible
int findMaxSize(int a[], int n)
{
    vector<int> frq(n + 1);
  
    for (int i = 0; i < n; ++i)
        frq[a[i]]++;
  
    // Counting the maximum frequency
    int maxfrq
        = *max_element(
            frq.begin(), frq.end());
  
    // Counting total distinct elements
    int dist
        = n + 1 - count(
                      frq.begin(),
                      frq.end(), 0);
  
    int ans1 = min(maxfrq - 1, dist);
  
    int ans2 = min(maxfrq, dist - 1);
  
    // Find max of both the answer
    int ans = max(ans1, ans2);
  
    return ans;
}
  
// Driver code
int main()
{
  
    int arr[] = { 4, 2, 4, 1, 4, 3, 4 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    cout << findMaxSize(arr, n);
  
    return 0;
}
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation to Divide the array
// into two arrays having same size,
// one with distinct elements
// and other with same elements
import java.io.*; 
import java.util.*; 
  
class GFG { 
      
// Function to find the max size possible
static int findMaxSize(int a[], int n)
{
    ArrayList<Integer> frq = new ArrayList<Integer>(n+1);
      
    for(int i = 0; i <= n; i++) 
       frq.add(0); 
         
    for(int i = 0; i < n; ++i)
       frq.set(a[i], frq.get(a[i]) + 1);
         
    // Counting the maximum frequency
    int maxfrq = Collections.max(frq);
  
    // Counting total distinct elements
    int dist = n + 1 - Collections.frequency(frq, 0);
      
    int ans1 = Math.min(maxfrq - 1, dist);
    int ans2 = Math.min(maxfrq, dist - 1);
  
    // Find max of both the answer
    int ans = Math.max(ans1, ans2);
  
    return ans;
}
      
// Driver code 
public static void main(String[] args) 
    int arr[] = { 4, 2, 4, 1, 4, 3, 4 };
    int n = arr.length;
      
    System.out.println(findMaxSize(arr, n));
  
// This code is contributed by coder001
chevron_right

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation to divide the  
# array into two arrays having same  
# size, one with distinct elements 
# and other with same elements 
  
# Function to find the max size possible 
def findMaxSize(a, n): 
  
    frq = [0] * (n + 1
  
    for i in range(n): 
        frq[a[i]] += 1
  
    # Counting the maximum frequency 
    maxfrq = max(frq) 
          
    # Counting total distinct elements 
    dist = n + 1 - frq.count(0
    ans1 = min(maxfrq - 1, dist) 
    ans2 = min(maxfrq, dist - 1
  
    # Find max of both the answer 
    ans = max(ans1, ans2) 
  
    return ans 
  
# Driver code 
arr = [ 4, 2, 4, 1, 4, 3, 4
n = len(arr)
  
print(findMaxSize(arr, n)) 
  
# This code is contributed by divyamohan123
chevron_right

Output:
3

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.




Recommended Posts:


Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : coder001, divyamohan123

Article Tags :
Practice Tags :