Maximum Product Subarray - Google, Amazon, Facebook,Microsoft coding interview question Leetcode 152
0:00 Introduction
1:26 O(n^2) brute force approach
2:50 Scenarios and edge cases
3:52 Basic DP approach
5:03 Understand why we need to calculate minimum product array product
5:43 DP approach using Max and min product sub array product
10:03 Dry run of the optimised DP approach to account for both negatives and zeros
18:00 Coding
Dynamic Programming approach explained in detail!
