Given two sorted integer arrays nums1 and nums2, merge them into a single array in non-decreasing order.Approach involves initializing pointers and comparing elements to merge efficiently.The initial solution provided is optimized using a 'Two Pointer' approach.The code snippet for the optimized solution is shared along with key learnings from the task.