GitHub SWE Interview Question 2022 December | Arrays and Dynamic Programming | on-campus

Question 1: Maximum Product Subarray Problem Statement Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. Constraints 1 <= nums.length <= 2 x 104 -10 <= nums[i] <= 10 The product of any subarray of nums is guaranteed to fit in a 32-bit integer Examples Example 1: Input: nums = [2, 3, -2, 4] Output: 6 Explanation ...