Solution #907 - Neha Amin - 15/07/2025 #70
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
NEHA-AMIN
changed the title
JRS296
requested changes
Jul 19, 2025
NEHA-AMIN
force-pushed
the
feature/subarray-sum-min
branch
from
6197aab to
405a973
Compare
NEHA-AMIN
changed the title
NEHA-AMIN
force-pushed
the
feature/subarray-sum-min
branch
from
405a973 to
86762bc
Compare
I've made the changes. Could you review it again? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds a solution for Leetcode Problem: Sum of Subarray Minimums.
The goal is to compute the sum of the minimum element across all contiguous subarrays for a given integer array.
A highly efficient solution is provided using a monotonic stack that allows us to determine, for each element in the array, how many subarrays it serves as the minimum value.