Longest Common Subsequence

preview_player
Показать описание
Given two strings, find longest common subsequence between them.
Рекомендации по теме
Комментарии
Автор

This is the clearest, complete, and most concise explanation of longest common subseq I've seen so far. Thank you so much!

chenjus
Автор

Tushar's favorite line - `Yes, we will use dynamic programming to solve this ;)`

ketan
Автор

reading wikipedia for ages...
finnaly with your video i do understand the sequence so thank you very much:)

greetings from Germany:)

GameKeppers
Автор

The best part about his lectures are that the way he demonstrates things makes our brain automatically figure out why we are doing this and this is what no other channel on YouTube provides.
I'm really thankful to Tushar for making iterative dp my second nature 🙏🏼❤

amanrubey
Автор

Love, how knowledgeable and clear as a teacher you are. Absolutely in debt. Much respect

niqbal
Автор

Nothing on the net has made DP more easier..thanks a ton!! :)

NehaJain
Автор

I still come back to this video years later after tripling my SWE salary, priceless content

thesoftwareman
Автор

took only 8 minutes to explain what most take 20+ minutes. And you did it great. cleared up everything. Thanks

rma
Автор

All your videos are just awesome. You explain every detail so clearly . I like that you don't rush the things.

anshusharma
Автор

The video that started my interest in dynamic programming. Seen this video 4 years ago in 2017 for the first time and with one example I got the whole idea about Dynamic programming. After that I'm able to solve most of the coding problems using Dynamic Programming approach.

satishchandra
Автор

I learned most of the stuff from your videos, sir. It's quite helpful.Thank you so much.

malinisai
Автор

Thank you Tushar. I am sure that no one have explained Dynamic Programming this simple and straightforward. Even we may not be able understand how the values are filled in the DP array dynamically in other explanations. Most of them are always very simple Fibonacci example or very high level. So, for anyone who would like to understand Dynamic Programming, your videos are the best.

nathant
Автор

Just wanted to revisit Tushar's videos after completing my employment of 4 years at Google in the Bay Area. big thanks to you Tushar to help me with this and other challenging problems!

dakshjay
Автор

Supper clear! After watching your explanation, I am able to finish the code within 5 min! Thank you!

yanzheng
Автор

I wonder how my teachers can explain such simple algorithms in a way that noone understands it. I learned all algorithms from indian students. Thx, I love you man <3 :D

padrino
Автор

One of the best explanations I ever saw on this topic !!.... Thank you very much sir 😀 👏🏻👏🏻

ameychavan
Автор

This is the clearest explanation I've seen, thank u so much guy !!!! 🥰

manhhungnguyen
Автор

You are an absolute champion, your answer and explanation was really clear great job.

GoldenSpud
Автор

Your way of teaching makes me visualise things and I really want to thank you for this.

aryankhare
Автор

One of the Best explanations I have heard so far in coding

prashantganeshsamudrala