>
> First sort the intervals
>
So, in our example it will be as follows
(2,7),(5,10),(6,15).
make a map which has got interval with corresponding number of overlaps
Now, iterate through each of the interval
for(i=0;i<(n-1);i++)
for(j=0;j<n;j++)
update the map with the number of overlaps.
--
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.
For more options, visit https://groups.google.com/groups/opt_out.
