LIS-LDS
0 Answers
LIS-LDS
| Flag | PURGE
Give an O(n log n)-time algorithm to find the longest increasing-decreasing subsequence of a sequence of n numbers. Prove the correctness of your algorithm.
e.g. increasing-decreasing sequence..
8,9,10,3
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.