### Maximum occurred integer in n ranges

Given n ranges in the form of Start Number and End Number in Two Array L and R such that

L[i]-R[i] is one range given. Our task is to find the maximum occurred smallest (first) integer in all the ranges. Means If more than one integer occurs max times, print the smallest one.

In other you can find similar code in

**Time Complexity**: O(n + MAX) and **Space Complexity : **O(Max)

We have tried to reduce complexity to O(n+m), space complexity : O(m) where m is largest integer in L or R

means m is largest range number.