diff --git a/exercises/practice/change/.approaches/introduction.md b/exercises/practice/change/.approaches/introduction.md
index 713e5070f..49100bf51 100644
--- a/exercises/practice/change/.approaches/introduction.md
+++ b/exercises/practice/change/.approaches/introduction.md
@@ -24,4 +24,4 @@ This approach ensures that we find the minimum number of coins required in a str
 For a detailed look at the code and logic, see the full explanation in the [Dynamic Programming Approach][approach-dynamic-programming].
 
 [approach-dynamic-programming]: https://exercism.org/tracks/java/exercises/change/approaches/dynamic-programming
-[dynamic-programming]: https://en.wikipedia.org/wiki/Dynamic_programming
\ No newline at end of file
+[dynamic-programming]: https://en.wikipedia.org/wiki/Dynamic_programming