@ richard : u'r algo takes O(n^2) time .. try to write code ... u'll come to know..
On Sun, Feb 17, 2013 at 1:13 PM, Richard Reed <exp.r...@gmail.com> wrote: > If the times are discrete, you can create an array with the size of > discrete time (0 to whatever, adjusted). For each time slot, add 1 to each > index of the array that corresponds to a time range. Then iterate through > the list to find the highest time tally. This is an O(n) solution. > > > On Sat, Feb 16, 2013 at 11:32 PM, shady <sinv...@gmail.com> wrote: > >> Given a number of time slots – start time and end time,“a b”, find any >> specific time with the maximum number of overlapping. >> >> -- >> 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. >> >> >> > > -- > 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. > > > -- 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.
