Grokking Google Coding Interview
Vote

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
Adam Slowik

Adam Slowik

· 8 months ago

    public int minArrayLength(int[] nums, int k) {
        // ToDo: Write Your Code Here.
        int counter = 0;
        int currentProduct = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] == 0){
                return 1;
            }
            currentProduct *= nums[i];
            if (currentProduct <= k) {
                counter++;
            } else {
                currentProduct = nums[i];
            }
        }
        return nums.length - counter; 
    }