diff --git a/dynamic_programming/coin_change.py b/dynamic_programming/coin_change.py
index a8af4d5cc..dca016359 100644
--- a/dynamic_programming/coin_change.py
+++ b/dynamic_programming/coin_change.py
@@ -2,7 +2,7 @@
 You have m types of coins available in infinite quantities
 where the value of each coins is given in the array S=[S0,... Sm-1]
 Can you determine number of ways of making change for n units using
-the given types of coints?
+the given types of coins?
 https://www.hackerrank.com/challenges/coin-change/problem
 """
 def dp_count(S, m, n):