Add Regular Expression Matching algorithm using DP with test cases #6624
+72
−0
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[][] memo
array.*
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.