Smallest Subarray With All Occurrences Of The Most Frequent Element

medium
Question Solve Solutions 
1. You are given an array(arr) of integers.
2. You have to find the element(x) with maximum frequency in the given array. 
3. Also, you have to find the smallest subarray which has all occurrences of the most frequent element i.e x.

Note -> If there are two or more elements with maximum frequency and the same subarray size then print the subarray which occurs first in the given array.

Input Format

A number N arr1 arr2.. N numbers

Output Format

A number(x) representing the maximum frequency element in the given array. Two numbers representing the start and end index of the smallest subarray with all occurrences of the most frequent element.

Constraints

1 <= N <= 10^6
1 <= arr[i] <= 10^5

Example

Input
8
4 1 1 2 2 1 3 3
Output
1
1
5
Previous
Check Arithmetic Sequence
Next
Task Completion

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String