@@ -24,6 +24,7 @@ My solutions to LeetCode problems in Kotlin.
 | [412](https://leetcode.com/problems/fizz-buzz/) | [Fizz Buzz](src/main/kotlin/com/schmoczer/leetcode/_0412/FizzBuzz.kt) | Easy |
 | [773](https://leetcode.com/problems/sliding-puzzle/) | [Sliding Puzzle](src/main/kotlin/com/schmoczer/leetcode/_0773/SlidingPuzzle.kt) | Hard |
 | [796](https://leetcode.com/problems/rotate-string/) | [Rotate String](src/main/kotlin/com/schmoczer/leetcode/_0796/RotateString.kt) | Easy |
+| [1342](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | [Number of Steps to Reduce a Number to Zero](src/main/kotlin/com/schmoczer/leetcode/_1342/NumberOfStepsToReduceANumberToZero.kt) | Easy |
 | [1480](https://leetcode.com/problems/running-sum-of-1d-array/) | [Running Sum of 1d Array](src/main/kotlin/com/schmoczer/leetcode/_1480/RunningSumOf1dArray.kt) | Easy |
 | [1574](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | [Shortest Subarray to be Removed to Make Array Sorted](src/main/kotlin/com/schmoczer/leetcode/_1574/ShortestSubarray.kt) | Medium |
 | [1672](https://leetcode.com/problems/richest-customer-wealth/) | [Richest Customer Wealth](src/main/kotlin/com/schmoczer/leetcode/_1672/RichestCustomerWealth.kt) | Easy |

@@ -0,0 +1,17 @@
+package com.schmoczer.leetcode._1342
+
+class NumberOfStepsToReduceANumberToZero {
+fun numberOfSteps(num: Int): Int {
+var reduced = num
+var steps = 0
+while (reduced > 0) {
+steps++
+if (reduced % 2 == 0) {
+reduced = reduced / 2
+} else {
+reduced -= 1
+}
+}
+return steps
+}
+}

@@ -0,0 +1,27 @@
+# Number of Steps to Reduce a Number to Zero
+
+Given an integer `num`, return the number of steps to reduce it to zero.
+
+In one step, if the current number is even, you have to divide it by `2`, otherwise, you have to subtract `1` from it.
+
+Example 1:
+
+> Input: num = 14
+>
+> Output: 6
+
+Example 2:
+
+> Input: num = 8
+>
+> Output: 4
+
+Example 3:
+
+> Input: num = 123
+>
+> Output: 12
+
+Constraints:
+
+- `0 <= num <= 10^6`

@@ -0,0 +1,44 @@
+package com.schmoczer.leetcode._1342
+
+import org.junit.jupiter.api.Assertions.assertEquals
+import org.junit.jupiter.api.BeforeEach
+import kotlin.test.Test
+
+class NumberOfStepsToReduceANumberToZeroTest {
+private lateinit var sut: NumberOfStepsToReduceANumberToZero
+
+@BeforeEach
+fun setUp() {
+sut = NumberOfStepsToReduceANumberToZero()
+}
+
+@Test
+fun `6 steps to reduce number 14`() {
+val input = 14
+val expected = 6
+
+val result = sut.numberOfSteps(input)
+
+assertEquals(expected, result)
+}
+
+@Test
+fun `4 steps to reduce number 8`() {
+val input = 8
+val expected = 4
+
+val result = sut.numberOfSteps(input)
+
+assertEquals(expected, result)
+}
+
+@Test
+fun `12 steps to reduce number 123`() {
+val input = 123
+val expected = 12
+
+val result = sut.numberOfSteps(input)
+
+assertEquals(expected, result)
+}
+}