MAXIMUM PRODUCT SUBARRAY dynamic programming Google, Amazon, coding interview question Leetcode 152

Published: 23 August 2022
on channel: Interview Ready

245

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!

On this page of the site you can watch the video online MAXIMUM PRODUCT SUBARRAY dynamic programming Google, Amazon, coding interview question Leetcode 152 with a duration of hours minute second in good quality, which was uploaded by the user Interview Ready 23 August 2022, share the link with friends and acquaintances, this video has already been watched 245 times on youtube and it was liked by 5 viewers. Enjoy your viewing!

12,487

385