## Count and print all Subarrays with product less than K in O(n)

Objective: Given an array of positive integers and integer ‘K’. Write an algorithm to count all the possible sub arrays where product of all the elements in the sub array is less than k. Example: Int [] nums = {10, 4, 2, 6}; K = 100 Output: 9 Sub arrays: [10], [10 4], [10, 4, 2], … Read more Count and print all Subarrays with product less than K in O(n)