46:05 for space optimization we don't require the loop for prev as the values are already zero in it.

In the future, Mr. Vikramaditya will go down as the G.O.A.T online DSA teacher.

@wahtNIGGA

4 ай бұрын

Yes he is GOAT I am the future

@abhishekkarn8918

2 ай бұрын

He is already for me.

If someone is following Striver's series then this LCS is also a cakewalk..#Striver gives u confidence and you are no longer scared of dp😁

putting your years of hardwork in some videos ,how lucky we are,Thanks a lot striver bhaiya for everything you are doing for us

Understood and you've completely changed my life. Doesn't matter if I get placed in a good company or not but the quality of this lectures are supreme and I will carry this knowledge for rest of my life.

@AdityaKumar-be7hx

Жыл бұрын

Keep trying. It will work out. Dream for the day when you are so good that you REJECT your dream company.

@iamnoob7593

5 ай бұрын

@@AdityaKumar-be7hx Requires god level consistency to do that.

@idris110

5 ай бұрын

You will probably forget the concepts, since these are never used in the industry. What a satire !

@bharatravihal9646

5 ай бұрын

🤣🤣@@idris110

@spoidy2025

3 ай бұрын

brother are you placed

15:34 "You kow i am hearing you" in the background

@jeet-smokey

4 ай бұрын

So?

Protect this guy at all costs. Thank you sir for all your hard work in making this video.

@mayanksingh7501

Ай бұрын

Everyone should be protected bro

understood bhaiya!!! after a very long time i am back to your channel....previously i was doing a race that as soon as you upload the video, i should watch it then n there, before the next video gets uploaded in this dp series, but due to some busy schedule, i lost the race. yeah, but your quality and energy is still the same as your starting videos

No other video on the topic will offer you a better explanation than this! This is just pure teaching excellence! Subscribed.

I used to be scared of Dp when I started coding journey, but when I am actually doing it, it's cake walk. Thankyou striver for sharing your knowledge.

I am very grateful to you for uploading this playlist. This is great!!!!!!!!!!!!!!!!!!!!! Understood.

bro!!!!!! What an explanation, absolutely brilliant. I am starting to love coding now. Thanks

You're a great teacher. If possible, please do problems about DP on tree. I struggle with them. Thank you!

What an easy explanation, loved it !

You can't find better explanation than this, Brilliant!!

absolutely minds bogling.i am not kidding i wasn't able to solve simple recusion questions few weeks ago now i can solve medium and hard dp questions on my own without watching videos.all i can say thank you striver.

Its taking while to digest this information for me , Just imagine the efforts this guy is adding to make it available for everyone.

UNDERSTOOD.....Thank You So Much for this wonderful video............🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

bro striver you have taught so well that i didnt even need to watch the video,i solved the problem in all three ways,thaank you very much❤

understood.wonderful. amazing. hats-off. unmatchable.

understood, always in awe of you genius and hard working you are:)

Understood,you are doing the great job , very thankful to you

Understood! Awesome explanation as always, thank you very much!!!

Loved the Explanation!!Understood

UNDERSTOOD... Thanks striver for the video... :)

Just one word , Beautiful!

Understood, Thank you so so much.

Dhonnobad Brother You are great

Giving my best shot for preparing for my placements. Let's see what happens in upcoming months. Great Content

You are amazing ❤️. Thanks a lot for this valuable content 🙌🙇🙇

Thanks bro the Playlist is top notch...am getting a lot better...Thanks again

Man the content is gold.

US ❤ I should mention I am solving DSA consistently from past 1 year. Encountered this question a lot of times. But till date this is the best explanation boss❤

awesome, understood..was pretty easy due to what you've alrready taught

Thank you so much bhaiya, I always heard of this question as one of the most difficult ones. But by following your DP series, I did it on my own. You can easily sell this quality content for ₹ 50k but you're giving it for free. BEST TEACHER EVER ♥♥♥♥

understood,previously I mugged up the tabulation formula for the exam ,but now I know how it came.

Thanks for great explanation striver

Can we do using single array if we denote prev[j-1] in a variable, keep updating it after every iteration of inner loop ?

what an explanation thanks for your time and such video

Thank You Very much Striver !

In Tabulation we are declaring vector with values zero. So we can skip first two loops.

Awesome lecture. Understood!

I deeply understand recursion, memoization, tabulation and space optimization.

Very good explanation. Understood. Thanks.

Thanks a lot striver

very well explained step by step

seriously you are a legit! understood ,thanks🙌

Why can't we put the base case at index 0? Especially for LCS - DP on strings related questions?

I solved with different tabulation approach (without shifting index) as below: int m=text1.length(); int n=text2.length(); int[][] dp = new int[m][n]; int temp=0; for(int i=0; i

@saddy4420

Жыл бұрын

same

hey man i know you are a very good teacher , but you are also a very good human being.

Thanks Striver. Understood LCS.

Without right shifting the Indexes, still we could do it as default initialise with 0 and then start from i=0 and j=0 but adding constraints of out of bounds. #include //Tabulation Solution int lcs(string s, string t) { int n1=s.size(); int n2=t.size(); vectordp(n1,vector(n2,0)); for(int i=0;i=0){ dp[i][j]=1+dp[i-1][j-1]; } else{ dp[i][j]=1; } } else{ int a=0,b=0; if(i-1>=0){ a=dp[i-1][j]; } if(j-1>=0){ b=dp[i][j-1]; } dp[i][j]=max(a,b); } } } return dp[n1-1][n2-1]; //Write your code here }

@NarenderMajoka

2 жыл бұрын

I did the same with java code

very good explanation

I’m just so thankful to you for this wonderful series, I’m honestly enjoying it dude, surely you’re one of the best! I even did the problem by myself so easily, i was shocked believing😂

@ishitasrivastava8417

Жыл бұрын

me too😂

Understood boss man!

GOAT for a reason❤❤

In interviews do we need to show the overlapping subproblems by taking longer examples or we can simply move on with memoization?

@coding8000

2 жыл бұрын

take till 5 to 6 steps., if recruiter does want , want he will tell u., to move to next step.

did it in 1st attempt without seeing the video, shifting index to right was new to me

Can also be done using single array if we preserve cur[j-1] in a prv variable

@takeUforward

2 жыл бұрын

Yeah.. you guys are learning fast 😍

@tejasghone5118

2 жыл бұрын

@@takeUforward thanks to your playlist💯

@jaykumargupta7307

2 жыл бұрын

@@tejasghone5118 can u provide the code

@himanshuguleria9474

2 жыл бұрын

@@jaykumargupta7307 int longestCommonSubsequence(string s1, string s2) { int n = s1.length(), m = s2.length(); vector cur(m+1, 0); int prev; for(int ind1=1; ind1

@ishwarshelke128

2 жыл бұрын

can u give the video link in which he taught this space opt technique

Understood Sir!

Understood, sir. Thank you very much.

who agrees that this dp series is one of the best on KZread

@tasneemayham974

9 ай бұрын

Not one of the best no. THE BESTTTTT!!!!!

Understood sir ! 🙏🙏

If someone is using java to write the code, in space optimization approach there will be error in a testcase, to resolve that error replace prev = curr with prev = curr.clone(); or else use the code snippet int [] temp = prev; prev = (curr); curr = temp; Because in java prev = curr will not create a new array but it will point both the references to same address. Your program would work fine.

hey great video but isn't the auxiliary stack space supposed to be max(s.size(), t.size())?

he is the example of beauty with brains

one of the best dp series

simple space optimization technique : just 2,3 chanes instead of using 2 different vectors we can just change dimension of dp to [no of previous rows we wanred + 1][no of colum] int longestCommonSubsequence(string s1, string s2) { vectordp(2, vector(s2.size()+1, 0)); // changing dimension as per need for(int i=1; i

Nice explanation raj bhaiyan or dude, I might call you angel!🥰🥰

Thank You Understood!!!

awesome paaji

Love the concept ✨

best dp playlist on youtube

Understood ❤

god!!! of teaching dsa understood

thank you so much!

Finally DP on strings Let's Go

Great explanation!

hey striver this is regarding ur tuf website......one feedback....can you add another checklist to mark important or tough nut questions so that for revision we can se it carefully again....because this subsequence is screewing up my brain :)

understood well !

Again @takeUforwad, just letting you know, again that's stuff you have done, is GOD's own work, thank you for from bottom of my heart, thanks !!!

This man is saviour. Thanks bhaiya ❤️

Understood. Only one point, if you are doing the tabulation to eliminate the O(m*n) S.C and then including (m+n) extra space for an extra row and column, it seems a bit redundant.

@takeUforward

2 жыл бұрын

m+n

understood bruh, plz make video on sliding window technique too.

We don't need to add base case while bottom-up in case of index shifting. If we just replace "-1" with "0" while initializing dp vector. Isn't it?

Thank you Striver for such a wonderful explanation. Finally understood it intuitively. 💯💯

Clear and Simple

Explained Like a Dopamine Hit!

Striver, why can't we return INT_MIN , in the base case. Because if we return 0, it will be added to 1 and the resultant number will be considered for maximum. And even if it is not the maximum, it will be returned. Your explanation is very intuitive.

Is it possible to represent every dp problem by recursion tree?

beautifully explained thanks a lot!!

Thanks learned new thing index shifting

how we computed the time complexity of recursive solution?

Can anyone please explain why (index1 == 0 || index2 == 0) has not been considered as base case here as we did in DP of arrays? In DP of Arrays, I was trying to use (index Can someone please explain why?

@sanyattaneja8551

Жыл бұрын

You can use index1 == 0 || index2 == 0 but then it will have 2 cases 1) if(index1 == 0 && index2 == 0) return s1[index1] == s2[index2] ; 2) if(index1 == 0 || index2 == 0) \\ using loop find the single character(having index == 0) in other string if present return 1 else return 0 therefore it is difficult to find and index < 0 base case is much easier so it's better to write that

Understood !!

Understood!

nice explaination !

GREAT AND INSIGHTFUL VIDEO

Was able to solve this on Leetcode by myself. Thanks Striver !!! public int longestCommonSubsequence(String s1, String s2) { int n1 = s1.length(),n2 = s2.length(); int[] prev = new int[n2]; //base cases if(s1.charAt(0)==s2.charAt(0)) prev[0]=1; for(int i=1;i

Decode ways is a new kind of pattern on dp on strings i think and that can be covered