In this problem, we have to compute the longest zig-zag subsequence using Dynamic Programming given a sequence of n integers as input.
-
Updated
Jun 6, 2021 - C++
In this problem, we have to compute the longest zig-zag subsequence using Dynamic Programming given a sequence of n integers as input.
Add a description, image, and links to the longest-zigzag-subsequence topic page so that developers can more easily learn about it.
To associate your repository with the longest-zigzag-subsequence topic, visit your repo's landing page and select "manage topics."