feat(content): hidden test cases
This commit is contained in:
@@ -9,6 +9,28 @@ categories:
|
||||
patterns:
|
||||
- sliding-window
|
||||
|
||||
function_signature: "def num_subarray_product_less_than_k(nums: list[int], k: int) -> int:"
|
||||
|
||||
test_cases:
|
||||
visible:
|
||||
- input: { nums: [10, 5, 2, 6], k: 100 }
|
||||
expected: 8
|
||||
- input: { nums: [1, 2, 3], k: 0 }
|
||||
expected: 0
|
||||
hidden:
|
||||
- input: { nums: [1, 1, 1], k: 2 }
|
||||
expected: 6
|
||||
- input: { nums: [10, 9, 10, 4, 3, 8, 3, 3, 6, 2, 10, 10, 9, 3], k: 19 }
|
||||
expected: 18
|
||||
- input: { nums: [1, 2, 3, 4, 5], k: 1 }
|
||||
expected: 0
|
||||
- input: { nums: [100], k: 101 }
|
||||
expected: 1
|
||||
- input: { nums: [100], k: 100 }
|
||||
expected: 0
|
||||
- input: { nums: [1, 1, 1, 1, 1], k: 2 }
|
||||
expected: 15
|
||||
|
||||
description: |
|
||||
Given an array of integers `nums` and an integer `k`, return *the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than* `k`.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user