We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent acfe5f5 commit 8d5909cCopy full SHA for 8d5909c
1 file changed
challenges/gcd.rst
@@ -1,8 +1,8 @@
1
Greatest Common Denominator
2
===========================
3
4
-**🎯 Implement the**\ `Euclidean
5
-Algorithm <https://en.wikipedia.org/wiki/Euclidean_algorithm>`__\ **to
+**🎯 Implement the** `Euclidean
+Algorithm <https://en.wikipedia.org/wiki/Euclidean_algorithm>`__ **to
6
determine the greatest common denominator of two integers.**
7
8
Tests
0 commit comments