New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

152. maximum-product-subarray.cpp #474

Open

ShivangiRai1310 wants to merge 1 commit into codedecks-in:master from ShivangiRai1310:feat/cpp

ShivangiRai1310 commented Dec 30, 2023 •

edited

Loading

Description

C++ solution for 152. Maximum Product Subarray

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

Have you made changes in README file ?

Added problem & solution under correct topic.
Specified Space & Time complexity.
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:

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


          feat(cpp): Maximum product subarray

646b1ca

welcome bot commented Dec 30, 2023

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet