Problem Name : Maximum Product Subarray
Problem Link : https://leetcode.com/problems/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.
I've explained the thought process and logic behind the solution and show how to implement it in code. Please like, share and subscribe if you found the video useful. Feel free to ask in the comments section if you have any doubts.
00:00 : Introduction
00:06 : Understanding Question
01:15 : Brute Force Approach
02:06 : Optimal Approach
09:55 : Coding
#leetcodequestionandanswers #leetcodesolution #leetcode #leetcodesolutions #c++ #optimal
