Contiguous Subarrays with Product Constraint | Dataford Interview Questions

Count contiguous subarrays whose product is at most k (LeetCode 713 variant with a non-strict inequality).

Asked in the online assessment stage. One of 3 HackerRank tasks.

Implement count_subarrays(nums, k). Given a list of positive integers nums and a positive integer k, return the number of contiguous, non-empty subarrays whose product is less than or equal to k.

Constraints

1 <= len(nums) <= 30000
1 <= nums[i] <= 1000
1 <= k <= 10^15
Only non-empty contiguous subarrays are counted

Function Signature

def count_subarrays(nums, k):

Your question is Contiguous Subarrays with Product Constraint. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Count contiguous subarrays whose product is at most k (LeetCode 713 variant with a non-strict inequality).

Asked in the online assessment stage. One of 3 HackerRank tasks.

Constraints

1 <= len(nums) <= 30000
1 <= nums[i] <= 1000
1 <= k <= 10^15
Only non-empty contiguous subarrays are counted

Function Signature

def count_subarrays(nums, k):

Your question is Contiguous Subarrays with Product Constraint. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.