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

In one operation, you can choose two adjacent elements in nums whose product is less than or equal to k, and replace them with a single element equal to their product.

Return the minimum possible length of nums after performing any number of operations.

Constraints:

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

• $0 \leq$ nums[i] $\leq 10^9$

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

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.