Merge Sorted Array - LeetCode 88 - Java

[@observer861]

one of the rare videos where the instructor not only is good at solving but also, and more importantly in this case, explaining the solution

[@LeetCodeUniversity]

I really appreciate your kind words!

[@observer861]

@@LeetCodeUniversity i wish you could do all 150 top interview questions ;)

[@LeetCodeUniversity]

@@observer861I have to get back to it for sure!

[@sudhareddy1]

@@LeetCodeUniversity +1 looking for top 15o interview questions

[@athenkosimamfengu8259]

You just got yourself a new follower. What a beautiful beautiful explanation, wow

[@LeetCodeUniversity]

I really appreciate that!!

[@shashankvashishtha935]

Since i was searching this question for a better approach. thank you for this explanation.

[@LeetCodeUniversity]

Thank you very much my friend!

[@RohanKumar-nx2ry]

this is what i expect from my teacher anyways you teach really good bro😀

[@LeetCodeUniversity]

Thank you! I absolutely love to teach, glad you found it helpful!

[@melanieprevot4926]

Nice approach ! Thank you for sharing.

[@LeetCodeUniversity]

You are very welcome!

[@Emanuel-yb3qk]

Thanks for the video.

[@LeetCodeUniversity]

My pleasure!

[@suggestaname1685]

Thank yo so much for this amazing explanation. Really really good!

[@LeetCodeUniversity]

Thank you so much, I am so glad You benefited from the video!

[@notjohnAtall]

This is really nice. A refreshing approach and good explanations. Subscribed

[@LeetCodeUniversity]

Thank you for the kind words!

[@dianakyrychyk3731]

Thank you for the great explanation!

[@LeetCodeUniversity]

Diana, you are very welcome!

[@suiryakumaran2034]

Great Explanation. Thank you so much.

[@sysybaba420]

Love your explanation!

[@LeetCodeUniversity]

Thank you, I am so glad I helped!

[@chadsmith71]

very good. I am now a subscriber. great work.

[@LeetCodeUniversity]

Appreciate that!

[@_4p_]

Thanks

[@musamehdiyevv]

Thank you for the explanation. I think this code is simpler: class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int p = m + n - 1; int p1 = m - 1; int p2 = n - 1; while (p2 >= 0) { if (p1 >= 0 && nums1[p1] > nums2[p2]) { nums1[p] = nums1[p1]; p1--; p--; } else { nums1[p] = nums2[p2]; p2--; p--; } } } }

[@nikeshsingh2081]

Great explanation..

[@LeetCodeUniversity]

Thank you!

[@axlash]

thank you 😊😊😊😊

[@LeetCodeUniversity]

You are very welcome!

[@swapnil72]

I did not understand why use the second while loop?

[@flyguynoaholdksa5461]

Nice

[@AanchalSharma-e4e]

please upload more questions

[@LeetCodeUniversity]

I will!

[@Jaffar87]

are u going to do all leetcode questions

[@LeetCodeUniversity]

The plan is to do Blind 75 list and then do pattern based questions

[@Jaffar87]

Thanks it would be nice if you do all the leetcode questions

[@kousthubganugapati7193]

will this work for every array

[@LeetCodeUniversity]

For sure!

[@alastairhewitt380]

Fantastic explanation Edit: In the while loop, if I only write p1 >= 0, then I get an index out of bound error, but if I include the logic for p1 & p2 then the code up until that point works properly. I am not really sure why that is since m & n are both 3. Can someone please help explain what I am not seeing? To me it is the same thing