Please enter your email address or userHandle.
Given an array A of size N. The elements of the array consists of positive integers. You have to find the largest element with minimum frequency.
Input Format: First line of input contains number of testcases T. For each testcase there will be two lines. First line contains N, next line contains N elements separated by spaces.
Output Format: For each testcase, print the largest element with minimum frequency.
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.
1 <= T <= 100
1 <= N <= 105
1 <= A[i] <= 106
2 2 5 50 1
Testcase 1: All elements are having frequency 1 except 2. 50 is the maximum element with minimum frequency.
Note: use HashMap to compute the element and its frequency.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.