Pattern Matching | Dynamic Programming | LCS

This video explains an important dynamic programming video which is pattern matching.In this problem, we are given a pattern and a string and we are required to find if the pattern exists entirely as a subsequence in the given string.This problem is a variant of Longest Common Subsequence because finding just the LCS of pattern and string we can solve this problem.If LCS of pattern and string is equal to pattern then we pattern is matched and we need to return true otherwise false.If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
========================================================================
Join this channel to get access to perks:
/ @techdose4u
INSTAGRAM : / surya.pratap.k
SUPPORT OUR WORK: / techdose
LinkedIn: / surya-pratap-kahar-47b...
WEBSITE: techdose.co.in/
TELEGRAM Channel LINK: t.me/codewithT...
TELEGRAM Group LINK: t.me/joinchat/...
=======================================================================
USEFUL LINKS:-
Longest Common Subsequence (LCS): • Longest common subsequ...
Longest Repeating Subsequence: • Longest Repeating Subs...
Uncrossed Lines: • Uncrossed Lines | Dyna...
#dp #lcs #patternmatching

[@abdqadr]

The fact that I could connect this problem to LCS before completing this video is amazing. Thank you tech dose for this wonderful playlist.

[@Rahul-rp5hk]

we can do it O(N) by using a pointer for P and for S

[@avinashkumar3340]

U r right. It's not a dp problem

[@HarishAmarnath]

Yes this is not dp problem

[@utkarshgupta2909]

This was the reason , i came in comments

[@abhinavmishra7617]

@@utkarshgupta2909 me too

[@iamakifislam]

The main thing is to learn the use of dynamic programming, not the solution of this problem. So hope this solving idea will help you to solve harder problem oneday.

[@abhinavmishra7617]

nice explanation and linking to lcs is nice, but why not use two pointers and do it in one pass in O(n) ?

[@parasjain9416]

Dhanyawada

[@techdose4u]

Shukriya :)

[@yitingg7942]

Can you also do one for lc 10 Regular Expression Matching please ?

[@techdose4u]

It will come later in the series.

[@yitingg7942]

@@techdose4u Thanks a lot Sir!!

[@TheSinashah]

Does anyone know the corresponding leetcode question number?

[@niteshprajapat7918]

Hello Sir , please create next tutorial on Django. please sir

[@written_syntax]

kzbin.info/www/bejne/i57Pm4uQft6jesU&ab_channel=CoreySchafer

[@sudhanshugupta7387]

We can do it like this if(Len(LCS(S1, S2)) == Len(S1)) return true; Else return false