Maximum Product Subarray - Leetcode 152 | Using Kadane's Algorithm

🧩 *PROBLEM DESCRIPTION* 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. OR Given an integer array with negative numbers and zero find the subarray with maximum product, i.e. find the contiguous array elements that produce maximum product. ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ 🔗 *LINKS* ⭐Problem: https://leetcode.com/problems/maximum-product-subarray/ 💻Code: https://k5kc.com/cs/problems/maximum-product-subarray/ ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ 📂 *RELATED PLAYLISTS To Explore* 📃 Array Datastructure: https://www.youtube.com/playlist?list=PLB53ggSrd6qkSyvwZxLym8mYgjgGFVcs8 📈 Dynamic Programming: https://www.youtube.com/playlist?list=PLB53ggSrd6qmenwW5ENj-j_nz-Na5En_a 🟡 Medium Coding Problem: https://www.youtube.com/playlist?list=PLB53ggSrd6qmhoEi071-M4RTJiwz9uZEs 👁️ Blind 75: https://www.youtube.com/playlist?list=PLB53ggSrd6qnIQVx7itPCTJG9U-0iWLKE 🅾️ K5KC 150: https://www.youtube.com/playlist?list=PLB53ggSrd6qnxO05JBnyt7YVDqDwjg6mR ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ 🔔 _SUPPORT AND SUBSCRIBE_ Don’t forget to **like**, **subscribe**, and **comment** for more problem-solving content! 🚀 🎯 _Follow me for updates_: GitHub: https://github.com/kinshuk4 Twitter: https://x.com/k5kc_ Instagram: https://www.instagram.com/_k5kc_/ LinkedIn: https://www.linkedin.com/company/k5kc/