-
-
Notifications
You must be signed in to change notification settings - Fork 158
Adding the Solution of a problem 523 #917
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.
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
Conversation
Here's the code health analysis summary for commits Analysis Summary
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Great job, @parikhitritgithub! 🎉 Thank you for submitting your pull request to CodeHarborHub. We appreciate your contribution and enthusiasm! Our team will review it soon. If you have any questions or need further assistance, feel free to reach out. Thanks for contributing!
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
update code based on suggestions
dsa-solutions/lc-solutions/0500-0599/523. Continuous Subarray Sum.md
Outdated
Show resolved
Hide resolved
dsa-solutions/lc-solutions/0500-0599/523. Continuous Subarray Sum.md
Outdated
Show resolved
Hide resolved
dsa-solutions/lc-solutions/0500-0599/523. Continuous Subarray Sum.md
Outdated
Show resolved
Hide resolved
dsa-solutions/lc-solutions/0500-0599/523. Continuous Subarray Sum.md
Outdated
Show resolved
Hide resolved
dsa-solutions/lc-solutions/0500-0599/523. Continuous Subarray Sum.md
Outdated
Show resolved
Hide resolved
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
now solve your last error and complete task
For this constraint $1 \leq \text{nums.length} \leq 105$ an $O(n^2)$ solution may lead to TLE | ||
|
||
|
||
A hash map with care on prefix sum mod k to use is however a tip The array version is used when k<n combining the hash map version that will be the faster than other solutions |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
replace k<n
to
`k<n`
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
finally done . Thank you
|
Related Issue
..
Description
Adding the Solution of a problem 523
issue : #890
Type of PR
Checklist
Resources for Guidance
Here are some resources that may be helpful as you contribute to CodeHarborHub:
Resources for DSA Features on Our Site: