Regular Expression Matching (LeetCode 10)
HardLeetCode 10 · Recursion on Strings & Arrays · Google, Amazon +20 · 54:24Regular Expression Matching · Brute Force · Optimal · Recursion Concepts And QuestionsMy notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 10 Regular Expression Matching by codestorywithMIK: Recursion, Hard. Topics: String, Dynamic Programming, Recursion. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- String, Dynamic Programming, Recursion
- Patterns
- Recursion on Strings & Arrays
- Chapter
- Recursion
- Duration
- 54:24
Related problems
- Reverse a Stack
- Generate Parentheses (LeetCode 22)
- Construct String from Binary Tree (LeetCode 606)
- Integer to English Words (LeetCode 273)
- Different Ways to Add Parentheses (LeetCode 241)
- Find the K-th Character in String Game II (LeetCode 3307)
- Find Kth Bit in Nth Binary String (LeetCode 1545)
- Special Binary String (LeetCode 761)