88. Merge Sorted Array | LeetCode 101 | JavaScript Solution

In this video, we solve the **Merge Sorted Array** problem from LeetCode. This is a common interview question that tests your understanding of arrays and in-place modifications. Learn how to merge two sorted arrays into one efficiently using pointers!

### 📝 **Problem Statement:**
You are given two sorted arrays, `nums1` and `nums2`, and two integers, `m` and `n`. The task is to merge `nums2` into `nums1` so that the resulting array is sorted. The merge must be done in-place, without using extra space.

### 💡 **What You'll Learn:**
- How to use the **two-pointer technique** to solve array problems.
- Efficiently merging two sorted arrays in **O(m + n)** time complexity.
- Tips and tricks to handle in-place array modifications.

### 🔍 **Solution Highlights:**
- Start merging from the end of `nums1` and `nums2` to avoid overwriting values.
- Use a pointer for the end of the merged array and move it backward as you compare elements.
- Handle edge cases like empty arrays and placeholder values.

### 📋 **Examples in the Video:**
1️⃣ Input: `nums1 = [1, 2, 3, 0, 0, 0], nums2 = [2, 5, 6], m = 3, n = 3`
Output: `[1, 2, 2, 3, 5, 6]`

2️⃣ Input: `nums1 = [1], nums2 = [], m = 1, n = 0`
Output: `[1]`

3️⃣ Input: `nums1 = [0], nums2 = [1], m = 0, n = 1`
Output: `[1]`

### 🚀 **Why Watch?**
This video will help you ace array-related coding interview questions with a focus on problem-solving techniques and step-by-step explanations.

### 🔗 **Resources:**
- [LeetCode Problem Link](https://leetcode.com/problems/merge-sorted-array/)
- [Code in the Video](https://leetcode.com/problems/merge-sorted-array/submissions/1500600358)

---

Feel free to modify this description to fit your style or add links to other related content on your channel! 😊

Видео 88. Merge Sorted Array | LeetCode 101 | JavaScript Solution канала Software Interviews Prep