Subarray Product Less Than K

Medium

sliding-windowarraytwo-pointers

Given an array of positive integers and an integer k, count the number of contiguous subarrays whose product is strictly less than k.

Input

Output: the count of qualifying subarrays.

Example 1

Input:

10 5 2 6
100

Output:

[10], [5], [2], [6], [10 5], [5 2], [2 6], [5 2 6].

Example 2

Input:

1 2 3
0

Output:

Run your code against the sample tests, or Submit to run the full suite.

Medium

sliding-windowarraytwo-pointers

Given an array of positive integers and an integer k, count the number of contiguous subarrays whose product is strictly less than k.

Input

Output: the count of qualifying subarrays.

Example 1

Input:

10 5 2 6
100

Output:

[10], [5], [2], [6], [10 5], [5 2], [2 6], [5 2 6].

Example 2

Input:

1 2 3
0

Output:

Run your code against the sample tests, or Submit to run the full suite.