Feature: Fully optimized valid parentheses checker#6767
Closed
coder-Basundhara wants to merge 6 commits intoTheAlgorithms:masterfrom
Closed
Feature: Fully optimized valid parentheses checker#6767coder-Basundhara wants to merge 6 commits intoTheAlgorithms:masterfrom
coder-Basundhara wants to merge 6 commits intoTheAlgorithms:masterfrom
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #6767 +/- ##
============================================
- Coverage 77.33% 77.32% -0.01%
- Complexity 6171 6175 +4
============================================
Files 721 721
Lines 20589 20589
Branches 3992 3992
============================================
- Hits 15922 15920 -2
Misses 4055 4055
- Partials 612 614 +2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
Member
|
@coder-Basundhara Please fix the failing workflows so I can start the review. |
|
This pull request has been automatically closed because its workflows or checks failed and it has been inactive for more than 14 days. Please fix the workflows and reopen if you'd like to continue. Merging from main/master alone does not count as activity. |
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
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.
Implemented an optimized valid parentheses checker (BalancedBrackets.java) that supports all bracket types: (), [], {}, and <>. The solution handles all edge cases and ensures O(n) time and O(n) space complexity using a stack.
Details:
Edge cases handled:
Empty strings (returns true)
Null input (throws IllegalArgumentException)
Odd-length strings (cannot be balanced)
Strings with non-bracket characters (returns false)
Nested and mixed brackets of any valid combination
Optimizations:
Single pass through the string (O(n) time)
Stack stores only unmatched opening brackets (O(n) space in worst case)
Immediate rejection for unmatched or invalid characters
Testing:
Verified against existing JUnit 5 test cases in BalancedBracketsTest.java
All tests for paired brackets, unbalanced strings, null inputs, and invalid characters pass successfully
Impact:
This implementation ensures that the algorithm is robust, efficient, and ready for use in any project requiring balanced bracket validation.