Tag: 2D Array

16

Sep2018
Problem:. Write an algorithm to count all the possible sub arrays where product of all the elements in the sub array is less than k. You are given with an interger array and a value 'k'.   Example: Int [] nums = {5, 3, 2, 4}; K = 100 Output: 11 Sub arrays: [5], [5 3], ... Read More

Contact us





Scroll Up