diff --git a/CoinChange/step1.md b/CoinChange/step1.md
new file mode 100644
index 0000000..cfdad61
--- /dev/null
+++ b/CoinChange/step1.md
@@ -0,0 +1,23 @@
+```java
+// DP
+// Create list to keep the min number of coins needs foreach amount
+// Time complexity: O(N * M) N: amount, M: number of coins
+// Space complexity: O(N) memory for dp array
+// Time spend: 03:45
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int[] dp = new int[amount + 1];
+
+        for (int i = 1; i <= amount; i++) {
+            dp[i] = 10001;
+            for (int coin : coins) {
+                if (i - coin >= 0) {
+                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+                }
+            }
+        }
+
+        return dp[amount] == 10001 ? -1 : dp[amount];
+    }
+}
+```
\ No newline at end of file
diff --git a/CoinChange/step2.md b/CoinChange/step2.md
new file mode 100644
index 0000000..cbd774e
--- /dev/null
+++ b/CoinChange/step2.md
@@ -0,0 +1,24 @@
+```java
+// DP
+// Time spend: 01:20
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int[] dp = new int[amount + 1];
+
+        for (int i = 1; i <= amount; i++) {
+            dp[i] = amount + 1;
+            for (int coin : coins) {
+                if (i - coin >= 0) {
+                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+                }
+            }
+        }
+        
+        if (dp[amount] > amount) {
+            return -1;
+        }
+
+        return dp[amount];
+    }
+}
+```
\ No newline at end of file
diff --git a/CoinChange/step3.md b/CoinChange/step3.md
new file mode 100644
index 0000000..0a1ac15
--- /dev/null
+++ b/CoinChange/step3.md
@@ -0,0 +1,70 @@
+```java
+// Time spend: 01:40 
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int[] dp = new int[amount + 1];
+
+        for (int i = 1; i <= amount; i++) {
+            dp[i] = amount + 1;
+            for (int coin : coins) {
+                if (i - coin >= 0) {
+                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+                }
+            }
+        }
+
+        if (dp[amount] > amount) {
+            return -1;
+        }
+
+        return dp[amount];
+    }
+}
+```
+```java
+// Time spend: 01:25
+class Solution {
+public int coinChange(int[] coins, int amount) {
+int[] dp = new int[amount + 1];
+
+        for (int i = 1; i <= amount; i++) {
+            dp[i] = amount + 1;
+            for (int coin : coins) {
+                if (i - coin >= 0) {
+                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+                }
+            }
+        }
+
+        if (dp[amount] > amount) {
+            return -1;
+        }
+
+        return dp[amount];
+    }
+}
+```
+
+```java
+// Time spend: 01:45 
+class Solution {
+    public int coinChange(int[] coins, int amount) {
+        int[] dp = new int[amount + 1];
+
+        for (int i = 1; i <= amount; i++) {
+            dp[i] = amount + 1;
+            for (int coin : coins) {
+                if (i - coin >= 0) {
+                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
+                }
+            }
+        }
+
+        if (dp[amount] > amount) {
+            return -1;
+        }
+
+        return dp[amount];
+    }
+}
+```
\ No newline at end of file