Merge Sorted Array | LeetCode 88 | Easy

preview_player
Показать описание


00:00 Problem Description
01:59 Whiteboarding
06:28 Final code
Рекомендации по теме
Комментарии
Автор

Great explanation! Very clear!
Now in LeetCode a case with negative numbers are added. This approach work as well (one 'if' need to be added). Many thanks!

readonlylogin
Автор

Thanks for the explanation. I didn't see how this could be an "easy" problem before watching, but you made it very clear :)

themax
Автор

This channel is so underrated, this was such a good explanation.

fsxaviator
Автор

thank you for explaining this problem clearly. it's really helpful.

pone_enop
Автор

Such an elegant explanation, thanks, man.

prestoX
Автор

Thank you for explaining this clearly.

TheMotoChick
Автор

Could you explain how one would approach the problem from scratch and get a naïve solution and then go on and get the best solution ? How to think before starting the problem or how to think through the problem ? This video helped me out and I understood the solution. But If you would make a video about approaches etc, that would help a lot of students

dhruvjani
Автор

Can we do this from the beginning? so i1=0, i2=0, j=0. if i1 is less than i2, j=i1 then increment i1 & j, else j=i2 then increment i2 & j

rahmadanusadewa