Educative giveaway winners were contacted via email on May 2.

I like how talented, confident and yet humble errichto is! :)

6:24

I hope you keep growing in your youtube career world and in your competitive coding career. Awesome you share your experience and problem solving skills with us.

Best channel about coding! Please keep posting.

thank you so much Errichto for sharing your knowledge. I really enjoy thinking and learning with your explanation. It makes so much sense.

Great explanation. Thank you Errichto!

Yeeeeehhhh Now Errichto has sponsors!!! Progress

Damn, I started with the recursive approach but when I hit the time constraint I wasn't sure caching would be enough to pass and so I changed my mind and went iterative.

please keep posting videos like this, all the best..

Awesome video. Really loved your explanation.

Awesome! Please explain the iterative solution with drawings.

Can you please do the Hack the Interview 2 problem explaination for the last questions? 😅

So what is better iterative or recursive? Best explanation!!!

Hi Errichto, any particular reason to why you used a map instead of an int matrix when going for the recursive solution?

General doubt : if I have a vector pair of int and string vector > if I want to sort using direct stl sort function... It will sort using first value.... If first value is same for some two elements then it will sort according to lexicographical order of string but i want to sort according to first and then see if two elements of first are same then I want the first value which came first when I had push_backed and maintain the relative order what should I do?

please discuss the problem of minimum string coefficient of hackerrank hack the interview 2

I looked up the algorithm on Back to Back SWE. I couldn't solve it on my own. This question was my first cheat in the challenge.

Finally a sponsor😂

So humble.