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.
En esta página del sitio puede ver el video en línea Regular expression matching | Brute force to Dynamic Programming | Java solution | Leet code de Duración online en buena calidad , que subió el usuario Prabhakar Annarapu 01 enero 1970, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 277 veces y le gustó 7 a los espectadores. Disfruta viendo!
