Problem Brief
Find the Maximum Length of a Good Subsequence I (LC 3176 :)
INTERNOA
See Snowflake online assessment and hiring insights
You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].
Return the maximum possible length of a good subsequence of nums.
Function Description
Complete the function maxLengthGoodSubsequence in the editor.
maxLengthGoodSubsequence has the following parameters:
- 1.
int[] nums: an array of integers - 2.
int k: a non-negative integer
Returns
int: the maximum possible length of a good subsequence
🌷 All credits go to the incredible Lie ༊·° 𓇢𓆸
1Example 1
Input
nums = [1,2,1,1,3], k = 2
Output
4
Explanation
The maximum length subsequence is [1,2,1,1,3].
2Example 2
Input
nums = [1,2,3,4,5,1], k = 0
Output
2
Explanation
The maximum length subsequence is [1,2,3,4,5,1].
Constraints
Limits and guarantees your solution can rely on.
1 <= nums.length <= 5001 <= nums[i] <= 10^90 <= k <= min(nums.length, 25)