Frequency Game | GeeksForGeeks Problem of the Day | 31May

 Given an array A of size N. The elements of the array consist of positive integers. You have to find the largest element with minimum frequency.

Example 1:

Input: 
5
2 2 5 50 1
Output:
50
Explanation :
All elements are having frequency 1 except 2.
50 is the maximum element with minimum frequency.

Example 2:

Input:
4
3 3 5 5
Output:
5
Explanation:
Both 3 and 5 have the same frequency, so 5 should be returned.

User Task:
Your task is to complete the provided function LargButMinFreq(A, n) which accepts array A and n. Hence you have to return the largest element with minimum frequency.

Expected Time Complexity: O(N)
Expected Space Complexity: O(N)

Constraints:
1 <= N <= 105
1 <= A[i] <= 106


SOLUTION(in C++) -


//{ Driver Code Starts

// Initial Template for C++


#include <bits/stdc++.h>

using namespace std;



// } Driver Code Ends

// User function Template for C++


class Solution{

public:

    int LargButMinFreq(int a[], int n) {

        // code here

        map<int, int> m;

        for(int i =0;i<n;i++){

            m[a[i]]++;

        }

        int mini = INT_MAX;

        for(auto i : m){

            if(i.second<mini){

                mini = i.second;

            }

        }

        int maxi = INT_MIN;

        for(auto i:m){

            if(i.second == mini && i.first > maxi){

                maxi = i.first;

            }

        }

        return maxi;

    }

};


//{ Driver Code Starts.


int main() {

    int t;

    cin >> t;

    // Iterating over testcases

    while (t--) {

        int n;

        cin >> n;


        int arr[n];


        for (int i = 0; i < n; i++) cin >> arr[i];

        Solution ob;


        cout << ob.LargButMinFreq(arr, n) << endl;

    }

}

// } Driver Code Ends

Comments

Post a Comment

Popular posts from this blog

WAP to add or to multiply two matrices of order nXn.

#include <stdio.h> int main() {     // Write C code here     int n1, n2, i, j, m1[10][10], m2[10][10], sum[10][10], mul[10][10], k;     printf("Enter the order of the matrix: ");     scanf("%d%d", &n1, &n2);     printf("Enter the elements of the 1st matrix: ");     for (i=0; i<n1; i++) {         for (j=0; j<n2; j++) {             scanf("%d", &m1[i][j]);         }     }     printf("Enter the elements of the 2st matrix: ");     for (i=0; i<n1; i++) {         for (j=0; j<n2; j++) {             scanf("%d", &m2[i][j]);         }     }     for (i=0; i...
Read more

WAP that inputs two arrays and saves sum of corresponding elements of these arrays in a third array

  #include <stdio.h> int main() {     int a[50], b[50], sum[50], i, n;     printf("Enter the Elements in an array: ");     scanf("%d", &n);     printf("Enter the Elements of 1st array: ");     for (i=0; i<n; i++)     scanf("%d", &a[i]);     printf("Enter the Elements of 2nd array: ");     for (i=0; i<n; i++)     scanf("%d", &b[i]);     for (i=0; i<n; i++)     sum[i] = a[i] + b[i];          printf("Sum of the corresponding element of 1st and 2nd array is ", sum[i]);     for (i=0; i<n; i++)     printf("%d,", sum[i]);     return 0; }
Read more

WAP to find the minimum and maximum element of the array by using functions.

  #include <stdio.h> int max(int arr[], int n) {     int max = arr[0];     for(int i=0; i<n; i++) {         if (max < arr[i])         max = arr[i];     }     return max; } int min(int arr[], int n) {     int min = arr[0];     for(int i=0; i<n; i++) {         if (min > arr[i])         min = arr[i];     }     return min; } int main() {     int n, arr[50], i;     printf("Enter the number of element in an array: ");     scanf("%d", &n);     printf("Enter the elements in the array: ");     for (i=0; i<n; i++)     scanf("%d", &arr[i]);     printf("The maximum element of array is %d\nThe minimum elemen...
Read more