Edit Distance and its Variations | Dynamic programming

This video explains a very important dynamic programming type which is very frequently asked in interviews and it is the minimum edit distance problem.In this video, I have explained what is edit distance and where it can be used in real-life.I have shown the variations of edit distance problem using examples.I have also shown the identification techniques for the edit distance problem.At the end of the video,I have explained how to solve all the variants of edit distance having solved only one problem which is the minimum edit distance using insertion, deletion and substitution. 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/...
=======================================================================
MUST WATCH :-
Minimum edit distance: • Minimum edit distance ...
#dp #editdistance #dpstring

[@bharatgupta1813]

Best CZcams channel on DS Algo as of today ❤️ Thanks for making quality content like this.

[@techdose4u]

Welcome :)

[@saiprasoonat161]

All your videos are just amazing, your method of teaching where you also teach us each problem's applications is brilliant. It helped a lot. Thank you!!!!❤️

[@eeshsingh3336]

Hi, the way you explain the statement and approach is really amazing.
I just have a small request. Can you please make more videos on Backtracking and Greedy problems. That'll really be helpful. Great work bro 😁

[@techdose4u]

Sure. I will explain it when I reach that topic

[@priyanshunandan9648]

Thanks a lot Sir! I always search your channel whenever I solve any problem.
Please upload for the Word Wrap Problem.

[@techdose4u]

Sure :)

[@E__ShameemahamedS-bx2ed]

Wow I have learned biology also

[@techdose4u]

😂

[@vishalvikram8637]

GOAT💪💪

[@techdose4u]

😅

[@E__ShameemahamedS-bx2ed]

Amazing explanation

[@techdose4u]

Thanks

[@sagarrout5742]

appreciate your effort!!

[@techdose4u]

Thanks

[@thesaurabh62057]

thanks from mnnit

[@rushi8449]

Appreciated

[@techdose4u]

Thanks ☺️

[@vijaymarappan6693]

If all 3 operations are allowed. if (s1.len > s2.len) then delete and/or sub, if(s2.len > s1.len) then insert and/or sub and if(s2.len == s1.len) then sub. Am I right?

[@BlokeBritish]

is 'equals' to two ???
where do u get this from man ?

[@ghoshdipan]

Couldn't find the problem 'maximum profit in job scheduling' anywhere. Can you please make a video on the binary search approach.

[@amansahil2725]

approach by greedy i guess that will be much simpler

[@aravindravva3833]

what is the tool or device you are using for explaining logic?

[@JavaLovers]

even I am curious to know the tool name