You are given an integer array nums and an integer k.

A subarray is valid if the total number of distinct prime factors across all elements in the subarray is at most k.

Return the maximum length of a valid contiguous subarray.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $2 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ k $\leq 10^4$

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.