Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Example: Input: [1,5,6,4] Output: [120,24,20,30] The below solution takes O(N) time complexity and O(N) space complexity class Solution { public int[] productExceptSelf(int[] nums) { int[] left = new int[nums.length]; int[] right = new int[nums.length]; int[] result= new…… Continue reading Leetcode Problem Product of Array Except Self (Java) With Video
Tag: Leetcode
Trapping Rain Water Problem LeetCode Java Solution
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example: Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 class Solution { public int trap(int[] height) { int arrLength = height.length; int total = 0; if(arrLength<=2) return total; int[] leftMaxArr = new int[arrLength]; int[]…… Continue reading Trapping Rain Water Problem LeetCode Java Solution