Thanks for reply. I am looking for O(n) for solution. Davin
On Dec 23, 8:29 pm, snehal jain <[email protected]> wrote: > hint : use dp > > > > > > > > On Thu, Dec 23, 2010 at 8:30 PM, Davin <[email protected]> wrote: > > Marks for Questions(1,6): {10,15,20,25,10,20} > > Time for Each Questions(1,6) : { 2, 4,3,4, 2,4} > > Passing Marks : 40 Out of 100 > > > Find Questions with minimum time to pass the exam? > > > On Dec 23, 7:04 pm, juver++ <[email protected]> wrote: > > > Please clarify the problem statement. Provide example. > > > From the first view problem seems to be unclear. > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]<algogeeks%2bunsubscr...@googlegroups > > .com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
