DP hard: regex matching with .*

← Courses›Interview PrepModule 4 · Dynamic Programming & Heap›DP hard: regex matching with .*write54 / 100

Task

📝 **Question:** Implement `match(s, p)` using DP. Print results for these pairs: ('aa','a*'), ('mississippi','mis*is*p*.'), ('ab','.*c').

📋 Pick the right answer.

💡 **Hint:** Re-read the theory above if unsure.

Keep going

🎯write

Longest Increasing Subsequence in O(n log n)

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion