diff --git a/algorithms/12-hash-tables/2023-11-28-breaking/01-python.md b/algorithms/12-hash-tables/2023-11-28-breaking/01-python.md
index 6b51071..3bcc58e 100644
--- a/algorithms/12-hash-tables/2023-11-28-breaking/01-python.md
+++ b/algorithms/12-hash-tables/2023-11-28-breaking/01-python.md
@@ -145,13 +145,13 @@ regards to the insertion phase.
 If we were to compare the _always conflicting_ one with the first one, we can
 see that insertion took over 7× longer and lookups almost 9× longer.
 
-You can have a look at the code [here](path:///files/algorithms/hash-tables/breaking/benchmark.py).
+You can have a look at the code [here](pathname:///files/algorithms/hash-tables/breaking/benchmark.py).
 
 ## Comparing with the tree
 
 :::danger
 
-Source code can be found [here](path:///files/algorithms/hash-tables/breaking/benchmark.cpp).
+Source code can be found [here](pathname:///files/algorithms/hash-tables/breaking/benchmark.cpp).
 
 _Viewer discretion advised._