Maximum Frequency Number Problem Statement

Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

If multiple elements have the same maximum frequency, return the element that appears first in the array (i.e., the element with the lowest index).

Input

```The first line contains an integer 'T' which denotes the number of test cases. For each test case, the input consists of: - An integer 'N' on the first line denoting the size of the array. - 'N' space-separated integers on the second line denoting the elements of the array.```

Output

```For each test case, print the integer that has the maximum frequency on a new line.```

Example

```Input arr: [1, 2, 3, 1, 2] Output: 1```

Constraints

1

Question

Maximum Frequency Number Problem Statement

Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

If multiple elements have the same maximum frequency, return the element that appears first in the array (i.e., the element with the lowest index).

Input

```The first line contains an integer 'T' which denotes the number of test cases. For each test case, the input consists of: - An integer 'N' on the first line denoting the size of the array. - 'N' space-separated integers on the second line denoting the elements of the array.```

Output

```For each test case, print the integer that has the maximum frequency on a new line.```

Example

```Input arr: [1, 2, 3, 1, 2] Output: 1```

Constraints

1 <= T <= 5
1 <= N <= 10000
-10^3 <= |arr[i]| <= 10^3

Note

```You are not required to handle input or output operations. Simply implement the required function.```

Accepted Answer

Find the number with the highest frequency in an array, returning the first one in case of ties.

Count Frequencies: Use a hash map to count occurrences of each number in the array.
Track First Occurrence: Store the index of the first occurrence of each number to resolve ties.
Iterate Efficiently: Loop through the array once to build the frequency map and another pass to determine the maximum frequency.
Example: For input [1, 2, 3, 1, 2], the output is 1 since it appears first with the highest frequency.

Accepted Answer

import java.util.HashMap;

public class MaximumFrequencyNumber {

public static void main(String[] args) {
        // Example input array
        int[] arr = {1, 3, 2, 1, 4, 1, 3, 3, 2, 3, 3};

// Find the number with the maximum frequency
        int result = findMaximumFrequency(arr);

// Print the result
        System.out.println("The number with maximum frequency is: " + result);
    }

public static int findMaximumFrequency(int[] arr) {
        // HashMap to store the frequency of each number
        HashMap frequencyMap = new HashMap();

// Variables to track the maximum frequency and the corresponding number
        int maxFrequency = 0;
        int maxFrequencyNumber = -1;

// Iterate through the array
        for (int i = 0; i  maxFrequency ||
                (frequencyMap.get(num) == maxFrequency && maxFrequencyNumber == -1)) {
                maxFrequency = frequencyMap.get(num);
                maxFrequencyNumber = num;
            }
        }

return maxFrequencyNumber;
    }
}