diff --git a/Algorithm/CoinMatching/MinimumCoinProblem.php b/Algorithm/CoinMatching/MinimumCoinProblem.php
index 80679785f..ba5b453f5 100644
--- a/Algorithm/CoinMatching/MinimumCoinProblem.php
+++ b/Algorithm/CoinMatching/MinimumCoinProblem.php
@@ -61,7 +61,6 @@ class MinimumCoinProblem
                     ) {
                         $table[$i]     = $subRes + 1;
                         $usedCoins[$i] = $coins[$j] === null ? ($usedCoins[$i] ?? []) : \array_merge($usedCoins[$i - $coins[$j]] ?? [], [$coins[$j]]);
-						$coins[$j]     = null;
                     }
                 }
             }
diff --git a/tests/Algorithm/CoinMatching/MinimumCoinProblemTest.php b/tests/Algorithm/CoinMatching/MinimumCoinProblemTest.php
index f0db2d492..b6e3a5b39 100644
--- a/tests/Algorithm/CoinMatching/MinimumCoinProblemTest.php
+++ b/tests/Algorithm/CoinMatching/MinimumCoinProblemTest.php
@@ -28,8 +28,8 @@ class MinimumCoinProblemTest extends \PHPUnit\Framework\TestCase
     public function testMinimumCoins() : void
     {
         self::assertEquals(
-            [6, 6, 5],
-            MinimumCoinProblem::getMinimumCoinsForValueI([9, 6, 5, 6, 1], 17)
+            [],
+            \array_diff_key([6, 6, 5], MinimumCoinProblem::getMinimumCoinsForValueI([9, 6, 5, 6, 1], 17))
         );
     }
 }