@@ -38,5 +38,6 @@ My solutions to LeetCode problems in Kotlin.
 | [2914](https://leetcode.com/problems/minimum-number-of-changes-to-make-binary-string-beautiful/) | [Minimum Number of Changes to Make Binary String Beautiful](src/main/kotlin/com/schmoczer/leetcode/_2914/MinChanges.kt) | Medium |
 | [2924](https://leetcode.com/problems/find-champion-ii/) | [Find Champion II](src/main/kotlin/com/schmoczer/leetcode/_2924/FindChampionII.kt) | Medium |
 | [3011](https://leetcode.com/problems/find-if-array-can-be-sorted/) | [Find if Array Can Be Sorted](src/main/kotlin/com/schmoczer/leetcode/_3011/FindIfArrayCanBeSorted.kt) | Medium |
+| [3133](https://leetcode.com/problems/minimum-array-end/) | [Minimum Array End](src/main/kotlin/com/schmoczer/leetcode/_3133/MinimumArrayEnd.kt) | Medium |
 | [3163](https://leetcode.com/problems/string-compression-iii/) | [String Compression III](src/main/kotlin/com/schmoczer/leetcode/_3163/StringCompression3.kt) | Medium |
 | [3254](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | [Find the Power of K-Size Subarrays I](src/main/kotlin/com/schmoczer/leetcode/_3254/FindThePowerOfKSizeSubarrays.kt) | Medium |

@@ -0,0 +1,13 @@
+package com.schmoczer.leetcode._3133
+
+class MinimumArrayEnd {
+fun minEnd(n: Int, x: Int): Long {
+var count = 0
+var result = x.toLong()
+while (count < n - 1) {
+result = (result + 1) or x.toLong()
+count++
+}
+return result
+}
+}

@@ -0,0 +1,23 @@
+# Minimum Array End
+
+You are given two integers `n` and `x`. You have to construct an array of positive integers `nums` of size `n` where for
+every `0 <= i < n - 1`, `nums[i + 1]` is greater than `nums[i]`, and the result of the bitwise `AND` operation between
+all elements of `nums` is `x`.
+
+Return the minimum possible value of `nums[n - 1]`.
+
+Example 1:
+
+> Input: n = 3, x = 4
+>
+> Output: 6
+
+Example 2:
+
+> Input: n = 2, x = 7
+>
+> Output: 15
+
+Constraints:
+
+- `1 <= n, x <= 10^8`

@@ -0,0 +1,36 @@
+package com.schmoczer.leetcode._3133
+
+import org.junit.jupiter.api.BeforeEach
+import kotlin.test.Test
+import kotlin.test.assertEquals
+
+class MinimumArrayEndTest {
+private lateinit var sut: MinimumArrayEnd
+
+@BeforeEach
+fun setUp() {
+sut = MinimumArrayEnd()
+}
+
+@Test
+fun `when n = 3 and x = 4 then array end is 6`() {
+val n = 3
+val x = 4
+val expected: Long = 6
+
+val result = sut.minEnd(n, x)
+
+assertEquals(expected, result)
+}
+
+@Test
+fun `when n = 2 and x = 7 then array end is 15`() {
+val n = 2
+val x = 7
+val expected: Long = 15
+
+val result = sut.minEnd(n, x)
+
+assertEquals(expected, result)
+}
+}