Add Regular Expression Matching algorithm using DP with test cases#6624
Closed
kokatesaurabh wants to merge 5 commits intoTheAlgorithms:masterfrom
kokatesaurabh:dynamic-programming/regular-expression-matching
Closed
Add Regular Expression Matching algorithm using DP with test cases#6624kokatesaurabh wants to merge 5 commits intoTheAlgorithms:masterfrom kokatesaurabh:dynamic-programming/regular-expression-matching
kokatesaurabh wants to merge 5 commits intoTheAlgorithms:masterfrom
kokatesaurabh:dynamic-programming/regular-expression-matching
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #6624 +/- ##
=========================================
Coverage 75.74% 75.74%
- Complexity 5765 5781 +16
=========================================
Files 701 702 +1
Lines 19757 19770 +13
Branches 3831 3837 +6
=========================================
+ Hits 14964 14974 +10
- Misses 4214 4216 +2
- Partials 579 580 +1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
…#6613) Added algorithm to find the nth number in the SylvesterSequence
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.
Regular Expression Matching (Dynamic Programming)
Problem:
Implement regular expression matching with support for
.and*where:.matches any single character*matches zero or more of the preceding elementThe matching should cover the entire input string.
Solution:
Boolean[][] memoarray.*and.efficiently.Example Test Cases:
"aa""a"false"a"does not match entire string"aa""aa""a*"true'*'means zero or more of preceding element, so"aa"matches"ab"".*"true".*"matches zero or more of any characterFolder Structure:
src/main/java/com/thealgorithms/dynamicprogramming/RegularExpressionMatching.java→ main algorithmsrc/test/java/com/thealgorithms/dynamicprogramming/RegularExpressionMatchingTest.java→ JUnit test casesNotes:
This section can be added in your PR under Dynamic Programming algorithms or in a dedicated contributions section for new algorithms.