asked in interviews by 1 company
Time Limit: 2 sec Memory Limit: 128000 kB
Problem Statement
Given an integer array of size n. Print the three most occurring element. print them in order of their number of occurrence. If the number of occurrence is same then print the smaller number before.
Input
First line contains n. Next line contains n space separated integers. 
Constraints 3 &lt;= n &lt; = 105 1 &lt;= arr[i] &lt;= 105
Output
Output three integers. if there are not enough integers then print -1 for that place.
<pre><code class="lang-java">EXample
Input:
6
1 2 1 2 2 1

Output:
1 2 -1

Explanation:
number of occurrence of 1 = 3
number of occurrence of 2 = 3
so 1 is printed before 2.
there are only 2 elements so we print -1 as third number.
</code></pre>
Note: Do comment out solution with explanation. Your welcome ☻

*asked in interviews by* ***1 company***

Time Limit: 2 sec 
Memory Limit: 128000 kB

**Problem Statement**

Given an integer array of size n. Print the three most occurring element. print them in order of their number of occurrence. If the number of occurrence is same then print the smaller number before.

**Input**

First line contains n. 
Next line contains n space separated integers. 
 
**Constraints** 
3 &lt;= n &lt; = 105 
1 &lt;= arr\[i\] &lt;= 105

**Output**

Output three integers. if there are not enough integers then print -1 for that place.

```java
EXample
Input:
6
1 2 1 2 2 1

Output:
1 2 -1

Explanation:
number of occurrence of 1 = 3
number of occurrence of 2 = 3
so 1 is printed before 2.
there are only 2 elements so we print -1 as third number.
```

Note: Do comment out solution with explanation. Your welcome ☻

Easy Coding-Most occurring element