Question

Given an array of integers, its degree is defined as the number of occurrences of the element that occurs most frequently in the array. Given a list of integers, determine two properties

Answer 1

Answer:

Input :  arr[] = {4, 1, 1, 2, 2, 1, 3, 3}  

Output :   1, 1, 2, 2, 1

The most frequent element is 1. The smallest

subarray that has all occurrences of it is

1 1 2 2 1

Input :  A[] = {1, 2, 2, 3, 1}

Output : 2, 2

Note that there are two elements that appear

two times, 1 and 2. The smallest window for

1 is whole array and smallest window for 2 is

{2, 2}. Since window for 2 is smaller, this is

our output.

Explanation: