Merge Sorted Array | Live Coding with Explanation | Leetcode - 88

This video explains the 2 pointer approach to merge 2 sorted arrays in O(K) time.

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode

[AlgorithmsMadeEasy]

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

[sauravdhar]

This is probably the best explaination of this problem on youtube, Thank you for this

[steeck]

Thank you for this explanation! I see there are many ways to try and solve this problem. This way and the animations you used really helped me to properly conceptualize everything and understand your code.

[nos-]

you just managed to give the best explanation of this problem with the most optimal solution and its edge cases, space time complexity within just 5 mins ... brilliant

[ana-mariagarlau]

hi! thank you so much for this elegant solution. i had to repeatedly do it on paper in order to comprehend why this works but the idea is great!

[vansh]

When looking at the question how do you perform that kind of a solution in your mind ?

[jaishreesaraswat]

Very good visualization ...great work !

[PitBit]

Nice and concise explanation with good animations. Thank you! :)

[abhinavawasthi]

Much simpler code with best explanation!

[santimoyrana]

Such a beautiful explaination. My all doubts are cleared now.

[FRAMEDSKATEKREW]

I liked this video approach, very glad I found this video.

[headofthetable]

best explanation for this question forever.

[amanrathore]

very well explained with visual thank you so much for this amazing content

[rdubb]

Super clear. I often shake my head at the solutions in LC, they nearly always are more complicated than they need to be and you just proved that again.

[aanisnoor]

Such an easy to follow explanation, thank you!

[manokamnasingh]

this is the best explanation of this problem 💯

[mysteriousocean]

littlrly great explanation and also ppt presentation

[minarezkalla]

thank you 😍 this channel always helpful

[solar]

Great explanation but how is the space complexity constant time since we are adding elements to back of the array ?

[trustGod]

HI, how to solve the same question with this kind of parameter ?
public void merge(List< Integer>nums1, int m, List<Integer> nums2, int n)