Sponsored
Use these hints if you're stuck. Try solving on your own first.
For each j, let opt(j) be the smallest i so that nums[i] * nums[i+1] * ... * nums[j] is less than k. opt is an increasing function.
Solve with full IDE support and test cases
