I spent so much time to understood this and solve on my own. But because of your video I was able to understood it clearly. Please continue doing it bro.... I dont know how to say thanks to you.... this is the best tutorial for this solution according to me....
If there is only one vector we can use the builtin function. Here, lex_idx is a vector and str is a string. So we are not directly reversing here. We are more of swapping those indexes from lex_idx which inturn an idx of str.
I spent so much time to understood this and solve on my own. But because of your video I was able to understood it clearly. Please continue doing it bro.... I dont know how to say thanks to you.... this is the best tutorial for this solution according to me....
Thank you so much :)
I would like to say you are genius in explaining keep posting ❤❤
the best explaination of the concept which i was unable to understand bro thanks alot man
wonderful explanation ,good job keep making these vids
you are champ brother , you make my day
Thank you so much 😊
Amazing explanation sir Hats off
Thanks nice explanation❤
great one! keep uploading moree
Nice Explanation bro
thannk you for this explanation. it was great.
best
i solve this by myself even the edge case but i just do a silly mistake.. of not counting right of repeating last characters of largest subseq..!
can you pleae tell the algorithm
If i use built in function reverse without swapping operation?
If there is only one vector we can use the builtin function. Here, lex_idx is a vector and str is a string. So we are not directly reversing here. We are more of swapping those indexes from lex_idx which inturn an idx of str.
rating ??of thisone
1500
Could be around 1300