Chapters:
00:00:00 - 1. Intro
00:01:44 - 1.1. Levenshtein Distance
00:05:02 - 2. Recursive Algorithm
00:07:27 - 2.1. Base Cases
00:11:20 - 2.2. Recursive Cases
00:19:49 - 2.3. Bug
00:23:06 - 2.4. Performance problem
00:23:57 - 3. Python Memoization
00:27:35 - 4. Custom Cache Memoization
00:28:21 - 4.1. Passing the lengths of the strings along with the strings
00:35:17 - 4.2. 2D Table Cache
00:36:07 - 4.3. Constructing 2D Table in Python
00:38:41 - 4.4. Extra row and column in the table
00:40:17 - 4.5. Integrating the table with the algorithm
00:43:34 - 5. Recovering the Reference Implementation
00:46:17 - 6. How the cache changes over time?
00:46:50 - 6.1. Python Pretty-Print
00:49:00 - 6.2. Custom Pretty-Print
00:52:21 - 6.3. Cache is not visited fully
00:55:34 - 7. Non-Recursive Algorithm
01:09:02 - 8. Dynamic Programming
01:14:14 - 9. Computing the Sequence of Actions
01:15:26 - 9.1. Table of Actions
01:27:10 - 9.2. Back tracing
01:32:39 - 9.3. Implementation
01:36:43 - 9.4. Making sense of the back trace
01:47:24 - 9.5. Reporting specific characters in the back trace
01:53:31 - 10. QnA
01:55:09 - 11. Outro
01:55:21 - 12. Smooch
References:
https://en.wikipedia.org/wiki/Levensh...
Source Code: https://gist.github.com/rexim/2bd6b1b...
On this page of the site you can watch the video online String Diff in Python with a duration of hours minute second in good quality, which was uploaded by the user Tsoding Daily 07 March 2023, share the link with friends and acquaintances, this video has already been watched 18,834 times on youtube and it was liked by 567 viewers. Enjoy your viewing!