Description of the problem

Longest Alternating Subsequence is a problem of finding a subsequence of a given sequence in which the elements are in alternating order, and in which the sequence is as long as possible.

Example of the problem

References/Other comments

https://en.wikipedia.org/wiki/Longest_alternating_subsequence