Kindly post one question at a time otherwise it will become messy and people will get confused which solution belongs to which question. Thanks
On Saturday, February 9, 2013 2:45:35 PM UTC+5:30, Pratik Mehta wrote: > > Hi All, > I need ur help in solving few questions. > > Would you please help me out *BY GIVING THE ALGORITHM AND THE LOGIC > BEHIND IT and it's DEEP EXPLANATION IF POSSIBLE?* > > > * > * > > *a. Kadane’s Algo.* > > * > * > > *b. Linked-list intersection point.* > > * > [A tree with only parent pointer, how to find LCA?] > * > > * > > * > > * > c. Design a stack which can perform findMax in O(1). > * > > * > > * > > *d. Set of stocks for each day have been given. Need to find the days on > which I buy and sell share to earn max profit, alongwith finding the max > profit.* > > > * > e. Find top k searched elements from a continuous stream of data. > * > > * > > * > > *f. Given a linked-list and 2 integers k & m. Reverse the linked-list > till k elements and then traverse till m elements and repeat.* > > *Write production quality code.* > > * > * > > *g. An array of elements have been given. Find for each element, first > max element to its right.* > > * > * > > *h. Boundary traversal of a tree. Write the code.* > > > Please help me out... > > Thanks in advance... > > Thanks & Regards, > Pratik Mayur Mehta. > -- 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 [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
