📃: Adding Maximum Product Subarray Problem using Sliding Window Algorithm ->Leetcode problem -152

[MeenakshiAM]

🟢 Title : Maximum Product Subarray
🟢 Programming language : Java
🟢 Objective : Optimized Solution
🟢 Summary : Finding the maximum product of the subarray that could be obtained from the input array which could contain both positive and negative elements.
algorithm used- Sliding Window Algorithm

---

✅ Details to Include When Taking the Issue:
Name : Meenakshi

---

Happy Contributing! 🚀

Wishing you all the best on your open source journey😍.
Enjoy! 😎

[github-actions]

👋 Thanks for opening this issue! First please star the repository and follow me in github. We appreciate your feedback and will look into it as soon as possible.

[MeenakshiAM]

Hi @abhisek247767 sir

I like to provide solution for this problem please assign to me and please add hacktoberfest label to this one,
Thank You.

[github-actions]

Hello @MeenakshiAM! Your issue #112 has been successfully closed. ✅ Thank you for your contribution and helping us improve the project! If you have any more ideas or run into other issues, feel free to open a new one. Happy coding! 🚀