Merge Two Sorted Arrays || LeetCode 88 || Software Engineering Interview Question

Software Engineering Interview Question Merge Two Sorted Arrays. LeetCode Problem 88 Merge Sorted Arrays Algorithm Explained (In-place Solution).
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note: The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has enough space (size that is equal to m + n) to hold additional elements from nums2.
Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
Source Code: https://github.com/techbarik/LeetCode-Solution/blob/master/leetcode-88-merge-sorted-array.java
LeetCode Problem URL: https://leetcode.com/problems/merge-sorted-array/
++++++++++++++++++++++++++++++++++++++++++++++++++
TechBarik: https://www.youtube.com/channel/UCWbPk37WrNlQ2SM5Lb7pTZw
CS Ninja: https://www.youtube.com/channel/UCsQvox_DAmM8g027TnCNslA
Tushar Roy: https://www.youtube.com/user/tusharroy2525
GeeksforGeeks: https://www.youtube.com/channel/UC0RhatS1pyxInC00YKjjBqQ
CS Dojo: https://www.youtube.com/channel/UCxX9wt5FWQUAAz4UrysqK9A
Nick White: https://www.youtube.com/channel/UC1fLEeYICmo3O9cUsqIi7HA
Back to Back SWE: https://www.youtube.com/channel/UCmJz2DV1a3yfgrR7GqRtUUA
mycodeschool: https://www.youtube.com/user/mycodeschool
++++++++++++++++++++++++++++++++++++++++++++++++++
#LeetCode #CSNinja