refactor: wiki links -> md links

АиСД/Структуры/Хэш-таблицы.md

@@ -1,15 +1,15 @@
 ## Примеры задач
-- [[Continuous Subarray Sum]]
-- [[First Unique Character in a String]]
-- [[Group Anagrams]]
-- [[Insert Delete GetRandom O(1)]]
-- [[Intersection of Two Arrays II]]
-- [[Jewels and Stones]]
-- [[Line reflection]]
-- [[Longest Substring with At Most Two Distinct Characters]]
-- [[Longest Substring Without Repeating Characters]]
-- [[LRU Cache]]
-- [[Max Stack]]
-- [[Subarray Sum Equals K]]
-- [[Two Sum]]
-- [[Valid Parentheses]]
+- [Continuous Subarray Sum](../Задачи/LeetCode/Continuous%20Subarray%20Sum.md)
+- [First Unique Character in a String](../Задачи/LeetCode/First%20Unique%20Character%20in%20a%20String.md)
+- [Group Anagrams](../Задачи/LeetCode/Group%20Anagrams.md)
+- [Insert Delete GetRandom O(1)](../Задачи/LeetCode/Insert%20Delete%20GetRandom%20O(1).md)
+- [Intersection of Two Arrays II](../Задачи/LeetCode/Intersection%20of%20Two%20Arrays%20II.md)
+- [Jewels and Stones](../Задачи/LeetCode/Jewels%20and%20Stones.md)
+- [Line reflection](../Задачи/LeetCode/Line%20reflection.md)
+- [Longest Substring with At Most Two Distinct Characters](../Задачи/LeetCode/Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters.md)
+- [Longest Substring Without Repeating Characters](../Задачи/LeetCode/Longest%20Substring%20Without%20Repeating%20Characters.md)
+- [LRU Cache](../Задачи/LeetCode/LRU%20Cache.md)
+- [Max Stack](../Задачи/LeetCode/Max%20Stack.md)
+- [Subarray Sum Equals K](../Задачи/LeetCode/Subarray%20Sum%20Equals%20K.md)
+- [Two Sum](../Задачи/LeetCode/Two%20Sum.md)
+- [Valid Parentheses](../Задачи/LeetCode/Valid%20Parentheses.md)