Adding to the question. See inline. On Sunday, June 9, 2013 12:50:46 PM UTC+5:30, Monish Gupta wrote: > > There are n Intervals. *1 <= n <= 1,000,000.* *Limits of interval are > within 64 bit signed int.* Given a set of m numbers, tell in how many > intervals does each number exists. > Example: 4 Intervals: [2,3] [3,4] [1,4] [3,10]. Numbers 2,4,11 > For 2 -> 2 as 2 lies in *2* intervals. viz. [2,3], [1,4] > For 4 -> 3 as 4 lies in 3 intervals > For 11 -> 0 as 11 lies in none of the given 4 intervals. > > It can be easily done in O(m*n) by traversing n intervals for each number > in the given set of m numbers. How would improve this? > > Note: I could not fully recall, but I have seen very similar question in > codechef but could not find the same. >
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
