Merge Sorted Arrays | Leetcode 88 | live coding session

1) 0:00 Explaining the problem out loud 2) 1:28 Algorithm walkthrough 3) 4:00 Coding it up 4) 6:00 Time complexity // TC : O(n+m) // SC : O(1), where n are the no of elements in first array, m no of elements in second array Code Link https://github.com/Sunchit/Coding-Decoded/blob/master/January2021/MergeSortedArrays.java Repo link : https://github.com/Sunchit/Coding-Decoded/ Complete January Playlist: https://www.youtube.com/playlist?list=PLEI-q7w3s9gR8EhTsObcgM74NnIiAcRWm Complete December Playlist: https://www.youtube.com/playlist?list=PLEI-q7w3s9gQIB_urBmMV04f_NBelXJEP Channel link: https://www.youtube.com/c/CodingDecoded