day 11

Author: sachuverma

Leetcode Daily Challenge/January-2021/10. Create Sorted Array through Instructions.cpp

@@ -0,0 +1,50 @@
+/*
+Merge Sorted Array
+==================
+
+Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
+
+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 1:
+Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
+Output: [1,2,2,3,5,6]
+
+Example 2:
+Input: nums1 = [1], m = 1, nums2 = [], n = 0
+Output: [1]
+
+Constraints:
+0 <= n, m <= 200
+1 <= n + m <= 200
+nums1.length == m + n
+nums2.length == n
+-109 <= nums1[i], nums2[i] <= 109
+
+Hint #1  
+You can easily solve this problem if you simply think about two elements at a time rather than two arrays. We know that each of the individual arrays is sorted. What we don't know is how they will intertwine. Can we take a local decision and arrive at an optimal solution?
+
+Hint #2  
+If you simply consider one element each at a time from the two arrays and make a decision and proceed accordingly, you will arrive at the optimal solution.
+*/
+
+class Solution
+{
+public:
+  void merge(vector<int> &A, int m, vector<int> &B, int n)
+  {
+    int a = m - 1, b = n - 1;
+    int i = m + n - 1;
+
+    while (a >= 0 && b >= 0)
+    {
+      if (A[a] > B[b])
+        A[i--] = A[a--];
+      else
+        A[i--] = B[b--];
+    }
+
+    while (b >= 0)
+      A[i--] = B[b--];
+  }
+};

Leetcode Daily Challenge/January-2021/11. Merge Sorted Array.cpp

@@ -11,5 +11,9 @@
 | 7.  | [Longest Substring Without Repeating Characters](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/579/week-1-january-1st-january-7th/3595/) | [cpp](./07.%20Longest%20Substring%20Without%20Repeating%20Characters.cpp) |
 | 8.  | [Check If Two String Arrays are Equivalent](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/580/week-2-january-8th-january-14th/3597/) | [cpp](./08.%20Check%20If%20Two%20String%20Arrays%20are%20Equivalent.cpp) |
 | 9.  | [Word Ladder](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/580/week-2-january-8th-january-14th/3598/) | [cpp](./09.%20Word%20Ladder.cpp) |
-| .  | []() | [cpp](./.%20.cpp) |
-| .  | []() | [cpp](./.%20.cpp) |
+| 10.  | [Create Sorted Array through Instructions](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/580/week-2-january-8th-january-14th/3599/) | [cpp](./10.%20.cpp) |
+| 11.  | [Merge Sorted Array](https://leetcode.com/explore/challenge/card/january-leetcoding-challenge-2021/580/week-2-january-8th-january-14th/3600/) | [cpp](./11.%20Merge%20Sorted%20Array.cpp) |
+| .  | []() | [cpp](./.cpp) |
+| .  | []() | [cpp](./.cpp) |
+| .  | []() | [cpp](./.cpp) |
+| .  | []() | [cpp](./.cpp) |