Regular expression matching | Brute force to Dynamic Programming | Java solution | Leet code
Leet code 10. Regular expression matching : Hard problem
We will approach this problem step by step as below.
1. Looking this as simple string matching problem.
2. Adding dot(.) expression the simple string matching problem to add little complexity.
3. Adding star(*) expression to make the simple string matching to regular expression matching problem.
4. Solving the problem using the brute force recursion.
5. Evaluating and implement memorization by DP top down approach.
6. Evaluating and implementing bottom up DP.
We will start with brute force recursion and evaluate the DP solution based on the recursion.
Time line :
0:00 to 01:14 : Intro & Reading the problem statement.
01:24 to 05:15 : Solving Simple string matching (with out regex).
05:15 to 06:40 : Solving Simple string matching with dot(.) .
06:40 to 15:22 : Solving Regular expression matching with recursion.
15:30 to 18:40 : Solving Regular expression matching using Memorization(Top down of DP).
19:05 : Solving Regular expression matching using DP (Bottom up).
#leetcode #regularexpressionmatching #stepbystep #solution.
On this page of the site you can watch the video online Regular expression matching | Brute force to Dynamic Programming | Java solution | Leet code with a duration of online in good quality, which was uploaded by the user Prabhakar Annarapu 01 January 1970, share the link with friends and acquaintances, this video has already been watched 277 times on youtube and it was liked by 7 viewers. Enjoy your viewing!
