@@ -15,6 +15,7 @@ My solutions to LeetCode problems in Kotlin.
 | [49](https://leetcode.com/problems/group-anagrams/) | [Group Anagrams](src/main/kotlin/com/schmoczer/leetcode/_0049/GroupAnagrams.kt) | Medium |
 | [54](https://leetcode.com/problems/spiral-matrix/) | [Spiral Matrix](src/main/kotlin/com/schmoczer/leetcode/_0054/SpiralMatrix.kt) | Medium |
 | [73](https://leetcode.com/problems/set-matrix-zeroes/) | [Set Matrix Zeroes](src/main/kotlin/com/schmoczer/leetcode/_0073/SetMatrixZeroes.kt) | Medium |
+| [88](https://leetcode.com/problems/merge-sorted-array/) | [Merge Sorted Array](src/main/kotlin/com/schmoczer/leetcode/_0088/MergeSortedArray.kt) | Easy |
 | [125](https://leetcode.com/problems/valid-palindrome/) | [Valid Palindrome](src/main/kotlin/com/schmoczer/leetcode/_0125/ValidPalindrome.kt) | Easy |
 | [141](https://leetcode.com/problems/linked-list-cycle/) | [Linked List Cycle](src/main/kotlin/com/schmoczer/leetcode/_0141/LinkedListCycle.kt) | Easy |
 | [151](https://leetcode.com/problems/reverse-words-in-a-string/) | [Reverse Words in a String](src/main/kotlin/com/schmoczer/leetcode/_0151/ReverseWordsInString.kt) | Medium |

@@ -0,0 +1,33 @@
+package com.schmoczer.leetcode._0088
+
+class MergeSortedArray {
+// Runtime 0ms Beats 100.00%
+fun merge(nums1: IntArray, m: Int, nums2: IntArray, n: Int) {
+val copied = IntArray(m)
+System.arraycopy(nums1, 0, copied, 0, m)
+var i = 0
+var j = 0
+while (i < m || j < n) {
+if (i == m) {
+nums1[i + j] = nums2[j]
+j++
+continue
+}
+if (j == n) {
+nums1[i + j] = copied[i]
+i++
+continue
+}
+
+val number1 = copied[i]
+val number2 = nums2[j]
+if (number1 < number2) {
+nums1[i + j] = number1
+i++
+} else {
+nums1[i + j] = number2
+j++
+}
+}
+}
+}

@@ -0,0 +1,36 @@
+# Merge Sorted Array
+
+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 = 3
+>
+> Output: [1,2,2,3,5,6]
+
+Example 2:
+
+> Input: nums1 = [1], m = 1, nums2 = [], n = 0
+>
+> Output: [1]
+
+Example 3:
+
+> Input: nums1 = [0], m = 0, nums2 = [1], n = 1
+>
+> Output: [1]
+
+Constraints:
+
+- `nums1.length == m + n`
+- `nums2.length == n`
+- `0 <= m, n <= 200`
+- `1 <= m + n <= 200`
+- `-10^9 <= nums1[i], nums2[j] <= 10^9`

@@ -0,0 +1,39 @@
+package com.schmoczer.leetcode._0088
+
+import org.junit.jupiter.api.BeforeEach
+import org.junit.jupiter.params.ParameterizedTest
+import org.junit.jupiter.params.provider.Arguments
+import org.junit.jupiter.params.provider.MethodSource
+import kotlin.test.assertContentEquals
+
+class MergeSortedArrayTest {
+private companion object {
+@JvmStatic
+fun sortedArrays() = listOf(
+Arguments.of(intArrayOf(1, 2, 3, 0, 0, 0), 3, intArrayOf(2, 5, 6), 3, intArrayOf(1, 2, 2, 3, 5, 6)),
+Arguments.of(intArrayOf(1), 1, intArrayOf(), 0, intArrayOf(1)),
+Arguments.of(intArrayOf(0), 0, intArrayOf(1), 1, intArrayOf(1)),
+)
+}
+
+private lateinit var sut: MergeSortedArray
+
+@BeforeEach
+fun setUp() {
+sut = MergeSortedArray()
+}
+
+@ParameterizedTest(name = "{0} and {2} should be merged into {4}")
+@MethodSource("sortedArrays")
+fun `two integer arrays should be merged into the first one and be sorted`(
+nums1: IntArray,
+m: Int,
+nums2: IntArray,
+n: Int,
+expected: IntArray,
+) {
+sut.merge(nums1, m, nums2, n)
+
+assertContentEquals(expected, nums1)
+}
+}