152. maximum-product-subarray.cpp - Githubissues

codedecks-in / LeetCode-Solutions

This repository consists of solutions to the problem from LeetCode platform. Subscribe to our Channel for more updates

https://www.youtube.com/c/codedecks

MIT License

821 stars 415 forks source link

152. maximum-product-subarray.cpp #474

Open ShivangiRai1310 opened 8 months ago

ShivangiRai1310 commented 8 months ago

Description

C++ solution for 152. Maximum Product Subarray

Time Complexity: O(N)
Space Complexity: O(1)

Have you made changes in README file ?

[x] Added problem & solution under correct topic.
[x] Specified Space & Time complexity.
[x] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

[ ] Test A
[ ] Test B

Make sure all below guidelines are followed else PR will get Reject:

[x] My code follows the style guidelines of this project
[x] I have performed a self-review of my own code
[x] I have commented my code so that it is easy to understand
[x] I have made corresponding changes to the documentation
[x] My changes generate no new warnings
[ ] Any dependent changes have been merged and published in downstream modules

welcome[bot] commented 8 months ago

I can tell this is your first pull request! Thank you I'm so honored. :tada::tada::tada: I'll take a look at it ASAP!