Challenge: Merge Two Sorted Lists

Try to solve the Merge Two Sorted Lists problem.

We'll cover the following

Statement

Given two integer lists, nums1 and nums2, of size mm and nn, respectively, sorted in nondecreasing order. Merge nums1 and nums2 into a single list sorted in nondecreasing order.

Constraints:

  • 0≤m,n≤2000\leq m, n \leq 200

  • 1≤m+n≤2001\leq m + n \leq 200

  • −103≤-10^3 \leq nums1[i] , nums2[i] ≤103\leq 10^3

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.