Suppose we have a list of intervals with positive integer endpoints, ranging from 1 to n. We wish to find ```i``` such that ```i``` is contained the most number of intervals. For example,\n\nIntervals\n```\n(1,4)\n(4,10)\n(7,9)\n(2,4)\n```\nand ```n=10```\n\nThen the frequencies for each number is\n1 - 1\n2 - 2\n3- 2\n4- 3\n5- 1\n6- 1\n7- 2\n8- 2\n9- 2\n10-1\n\nThus the mode is ```4```. If there are multiple modes, we select the smallest one. \n\nThe simple approach would be to have an array of size ```n``` and update each time an interval contains a number which is probably not optimal. I tried viewing this my first sorting the intervals by first starting endpoint and then ending endpoint but got nothing better. Any optimizations?

Suppose we have a list of intervals with positive integer endpoints, ranging from 1 to n. We wish to find i such that i is contained the most number of interval