DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
Back to Arena
hard
DP

Regular Expression Matching

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Regular Expression Matching** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** 2D DP with '.' and '*' transitions **Edge Cases to Consider:** - (1) Empty pattern matches empty string - (2) Pattern is ".*" - (3) Multiple consecutive '.*'

Examples

Example 1
Input: "aa", "a"
Output: false
Example 2
Input: "aa", "a*"
Output: true
Explanation: a* matches aa
Example 3
Input: "ab", ".*"
Output: true
Explanation: .* matches all

Constraints

  • ▪Input arguments are within valid ranges
  • ▪Optimize for execution speed
  • ▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

  • ▪Empty pattern matches empty string
  • ▪Pattern is ".*"
  • ▪Multiple consecutive '.*'
Frequently Asked At
GoogleAmazonMicrosoftMeta