Additional link fixes.

Author: BethanyG

exercises/practice/rotational-cipher/.approaches/introduction.md

@@ -99,10 +99,9 @@ A recursive function is a function that calls itself.
 This approach can be more concise than other approaches, and may also be more readable for some audiences.
 
 ~~~~exercism/caution
-Python does not have any tail-call optimization and has a default [recursion limit][recursion-limit] of 1000 calls on the stack.
+Python does not have any tail-call optimization and has a default [recursion limit](https://docs.python.org/3/library/sys.html#sys.setrecursionlimit) of 1000 calls on the stack.
 Calculate your base case carefully to avoid errors.
 
-[recursion-limit]: https://docs.python.org/3/library/sys.html#sys.setrecursionlimit
 ~~~~
 
 

exercises/practice/rotational-cipher/.approaches/recursion/content.md

@@ -31,12 +31,10 @@ That translates to something like this: `<letter> + <letter> + <letter> + <lette
 
 ~~~~exercism/note
 By default, we can't have a function call itself more than 1000 times.
-Code that exceeds this recursion limit will throw a [`RecursionError`][recursion-error].
-While it is possible to [adjust the recursion limit][recursion-limit], doing so risks crashing Python and may also crash your system.
+Code that exceeds this recursion limit will throw a [`RecursionError`](https://docs.python.org/3/library/exceptions.html#RecursionError).
+While it is possible to [adjust the recursion limit](https://docs.python.org/3/library/sys.html#sys.setrecursionlimit), doing so risks crashing Python and may also crash your system.
 Casually raising the recursion limit is not recommended.
 
-[recursion-error]: https://docs.python.org/3/library/exceptions.html#RecursionError
-[recursion-limit]: https://docs.python.org/3/library/sys.html#sys.setrecursionlimit
 ~~~~
 
 [clojure]: https://exercism.org/tracks/clojure