Find the Maximum Length of a Good Subsequence I

Find the longest subsequence (order preserved) of nums that has at most k adjacent unequal pairs (i.e., at most k transitions between different values). This is typically solved with dynamic programming tracking positions and remaining allowed transitions (and the last chosen value) to maximize subsequence length.