Maximum Good Subarray Length

Sliding Window / 2 Pointer Contest Medium

Given two integer array nums and badNumbers, return the maximum length good subarray.

A subarray is good if it does not contain every number in badNumbers. All elements in badNumbers are distinct.

Constraints

[ ]

✅ Testcase

Input: {'nums': '[2, 7, 3, 4, 5, 3]', 'badNumbers': '[7, 5]'}

Expected:
4

Actual: -

Time: - sec

Status: Waiting