Hi
Try to Elaborate the Explanation ..plss
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, se
Hi
You can solve this by dynamic programming/memoization. Start off from
the left and maintain two lists of points, one for forward traversal
and one for reverse traversal. Each point would be in any one of the
lists. When you encounter a point try putting it in each of the lists
turn by turn and
