Leetcode - Longest Common Subsequence (Python)

[@marianomossburg6894]

I exclusively practice my leetcode with your videos. Thanks for everything you've done.

[@strandingstranger]

i love your channel, i really hope you will come back soon, your solutions are my absolute favorites

[@amir_mallick]

You really make it seem so easy. I learn a lot in the way that you explain and code out the solution. Thank you so much.

[@Bogdan_olmath]

I watched a lot of videos aboat LCS, but your one is the shortest and understandable. Thank you

[@shrutimhatre30]

Miss your videos. please make a video on "408 valid word abbreviation". Thank you.

[@baleygrsteysionfayf9818]

omg dude I spent hours thinking and you just put an end to my suffering

[@caowenlei]

can somebody explains why use if text1[r-1] == text2[c-1]: not if text1[r] == text2[c]? thanks

[@modreamer]

hi, how about labeling you videos with topics so we can focus better on ones we're actively practicing?

[@elegentt2900]

Nice visual explanation! Please keep posting all ^^

[@icaryslittle6370]

Miss the videos :(

[@abhradeepdey9054]

def longest_common_subsequence(x, y, count = 0): s1, s2= ((x, y) if len(x) < len(y) else (y, x)) for i in s1: if i in s2: count += 1 s1, s2 = s1[1:], s2[s2.index(i):] return count Can this be a good solution?

[@enthusiast1]

Great video, really clear explanation, thank you!

[@johnprice2358]

Hello again good sir, I am hoping you could help me out again. :) here's what i am trying to do; 1. first I have a list of 7 number combinations in an excel (a lot of it, about 500) 2. I'd like to import it to python 3. I'd like to filter it out using my desired criteria. e.i. -> Tens = set(["10","20","30","40"]) #filter in only 2 or less match if sum([1 for i in [a[0], a[1], a[2], a[3], a[4], a[5], a[6]] if i in Tens])