related to this problem, link given below :-
http://groups.google.com/group/algogeeks/browse_thread/thread/7cfb0a6f7d121d92/0adc692fad1bab40?hl=enlnk=gstq=DP+equation+for+interval+problem#0adc692fad1bab40
--
You received this message because you are subscribed to the Google Groups
Algorithm
It looks as if you have just pasted some Amazon interview questions on this
forum.
These are pretty common questions.
Try to come up with your own answers.
Do some research on google and previous posts on this forum. You'll get
answers to all of them.
If you have some idea and want to discuss
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
