Interleaving String | Dynamic Programming | Leetcode #97

This video explains a very important programming interview problem which is to find if a given string is an interleaving string of two other strings.I have explained the intuition for solving this problem along with all the required analysis and observations.I have first explained the problem statement using good example and then i have shown the intuition for solution using proper observations.I have also shown the requirement analysis of the problem and then I have shown the simple recursion solution.Recursion solution is exponential, therefore I have also shown the optimization to solve using the top-down dynamic programming approach which is also known as memoization.The time complexity reduces from exponential to polynomial.CODE LINK is present below as usual. 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:
https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g/join

INSTAGRAM : https://www.instagram.com/surya.pratap.k/

SUPPORT OUR WORK: https://www.patreon.com/techdose

LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168

WEBSITE: https://techdose.co.in/

TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5eEGI4aQ
=======================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/21d04b48d10a26a00765a5ad41560636
USEFUL VIDEOS:-
Unique Paths: https://youtu.be/rBAxUTqvlQA
Uncrossed Lines: https://youtu.be/duCx_62nMOA
Count Square Submatrices: https://youtu.be/Z2h3rkVXPeQ


#dp #topdown #memoization