You are given an integer array nums and a non negative integer k.

A sequence of integers seq is defined as good if there are at most k indices i within the range $0 \le i \le$ seq.length $- 2$ such that seq[i] $\neq$ seq[i + 1].

Return the maximum possible length of a good subsequence of nums.

Constraints:

• $1 \le$ nums.length $\le 500$

• $1 \le$ nums[i] $\le 10^9$

• $0 \le$ k $\le \min($nums.length, $25)$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.