**LeetCode Problem | LeetCode Problems For Beginners | LeetCode Problems & Solutions | Improve Problem Solving Skills | LeetCode Problems Java | LeetCode Solutions in C++**

Hello **Programmers/Coders,** Today we are going to share ** solutions to the Programming problems of LeetCode Solutions in C++, Java, & Python**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get a score or marks and LeetCode Coins. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for the **Merge Sorted Array** **in C++, Java & Python-LeetCode problem**. We are providing the **correct and tested solutions** to coding problems present on **LeetCode**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**About LeetCode**

*LeetCode* is one of the most well-known online judge platforms to help you enhance your skills, expand your knowledge and prepare for technical interviews.

LeetCode is for **software engineers who are looking to practice technical questions and advance their skills**. Mastering the questions in each level on LeetCode is a good way to prepare for technical interviews and keep your skills sharp. They also have a repository of solutions with the reasoning behind each step.

LeetCode has over 1,900 questions for you to practice, covering many different programming concepts. Every coding problem has a classification of either *Easy*, *Medium*, or *Hard*.

**LeetCode problems focus on algorithms and data structures. Here is some topic you can find problems on LeetCode:**

- Mathematics/Basic Logical Based Questions
- Arrays
- Strings
- Hash Table
- Dynamic Programming
- Stack & Queue
- Trees & Graphs
- Greedy Algorithms
- Breadth-First Search
- Depth-First Search
- Sorting & Searching
- BST (Binary Search Tree)
- Database
- Linked List
- Recursion, etc.

Leetcode has a huge number of test cases and questions from interviews too like Google, Amazon, Microsoft, Facebook, Adobe, Oracle, Linkedin, Goldman Sachs, etc. LeetCode helps you in getting a job in Top MNCs. To crack FAANG Companies, LeetCode problems can help you in building your logic.

** Link for the Problem** – Merge Sorted Array– LeetCode Problem

Merge Sorted Array– LeetCode Problem

**Problem:**

You are given two integer arrays `nums1`

and `nums2`

, sorted in **non-decreasing order**, and two integers `m`

and `n`

, representing the number of elements in `nums1`

and `nums2`

respectively.

**Merge** `nums1`

and `nums2`

into a single array sorted in **non-decreasing order**.

The final sorted array should not be returned by the function, but instead be *stored inside the array *`nums1`

. To accommodate this, `nums1`

has a length of `m + n`

, where the first `m`

elements denote the elements that should be merged, and the last `n`

elements are set to `0`

and should be ignored. `nums2`

has a length of `n`

.

**Example 1:**

Input:nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3Output:[1,2,2,3,5,6]Explanation:The arrays we are merging are [1,2,3] and [2,5,6]. The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.

**Example 2:**

Input:nums1 = [1], m = 1, nums2 = [], n = 0Output:[1]Explanation:The arrays we are merging are [1] and []. The result of the merge is [1].

**Example 3:**

Input:nums1 = [0], m = 0, nums2 = [1], n = 1Output:[1]Explanation:The arrays we are merging are [] and [1]. The result of the merge is [1]. Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1.

**Constraints:**

`nums1.length == m + n`

`nums2.length == n`

`0 <= m, n <= 200`

`1 <= m + n <= 200`

`-10`

^{9}<= nums1[i], nums2[j] <= 10^{9}

Merge Sorted Array– LeetCode Solutions

Merge Sorted Array Solution in C++:

class Solution { public: void merge(vector& nums1, int m, vector & nums2, int n) { int i = m - 1; // nums1's index (actual nums) int j = n - 1; // nums2's index int k = m + n - 1; // nums1's index (next filled position) while (j >= 0) if (i >= 0 && nums1[i] > nums2[j]) nums1[k--] = nums1[i--]; else nums1[k--] = nums2[j--]; } };

Merge Sorted Array Solution in Java:

class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int i = m - 1; // nums1's index (actual nums) int j = n - 1; // nums2's index int k = m + n - 1; // nums1's index (next filled position) while (j >= 0) if (i >= 0 && nums1[i] > nums2[j]) nums1[k--] = nums1[i--]; else nums1[k--] = nums2[j--]; } }

Merge Sorted Array Solution in Python:

class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: i = m - 1 # nums1's index (actual nums) j = n - 1 # nums2's index k = m + n - 1 # nums1's index (next filled position) while j >= 0: if i >= 0 and nums1[i] > nums2[j]: nums1[k] = nums1[i] k -= 1 i -= 1 else: nums1[k] = nums2[j] k -= 1 j -= 1