blog/assets/js/6e3cbca1.5d0620d6.js

"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3276],{29538:e=>{e.exports=JSON.parse('{"pluginId":"algorithms","version":"current","label":"Next","banner":null,"badge":false,"noIndex":false,"className":"docs-version-current","isLast":true,"docsSidebars":{"autogeneratedBar":[{"type":"link","label":"Introduction","href":"/algorithms/","docId":"algorithms-intro","unlisted":false},{"type":"category","label":"Algorithms and Correctness","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Vague postconditions and proving correctness of algorithms","href":"/algorithms/algorithms-correctness/postcondition-ambiguity","docId":"algorithms-correctness/postcondition-ambiguity","unlisted":false}],"href":"/algorithms/category/algorithms-and-correctness"},{"type":"category","label":"Asymptotic Notation and Time Complexity","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Time complexity of \u2039extend\u203a","href":"/algorithms/time-complexity/extend","docId":"time-complexity/extend","unlisted":false}],"href":"/algorithms/category/asymptotic-notation-and-time-complexity"},{"type":"category","label":"Recursion","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Recursion and backtracking with Robot Karel","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Solution to the problem","href":"/algorithms/recursion/karel/solution","docId":"recursion/2022-11-29-karel/solution","unlisted":false}],"href":"/algorithms/recursion/karel"},{"type":"category","label":"Introduction to dynamic programming","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Na\xefve solution","href":"/algorithms/recursion/pyramid-slide-down/naive","docId":"recursion/2023-08-17-pyramid-slide-down/naive","unlisted":false},{"type":"link","label":"Greedy solution","href":"/algorithms/recursion/pyramid-slide-down/greedy","docId":"recursion/2023-08-17-pyramid-slide-down/greedy","unlisted":false},{"type":"link","label":"Top-down DP solution","href":"/algorithms/recursion/pyramid-slide-down/top-down-dp","docId":"recursion/2023-08-17-pyramid-slide-down/top-down-dp","unlisted":false},{"type":"link","label":"Bottom-up DP solution","href":"/algorithms/recursion/pyramid-slide-down/bottom-up-dp","docId":"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp","unlisted":false}],"href":"/algorithms/recursion/pyramid-slide-down"}],"href":"/algorithms/category/recursion"},{"type":"category","label":"Red-Black Trees","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Pou\u017eit\xed \u010derveno-\u010dern\xfdch strom\u016f","href":"/algorithms/rb-trees/applications","docId":"rb-trees/applications","unlisted":false},{"type":"link","label":"On the rules of the red-black tree","href":"/algorithms/rb-trees/rules","docId":"rb-trees/rules","unlisted":false}],"href":"/algorithms/category/red-black-trees"},{"type":"category","label":"Graphs","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Iterative algorithms via iterators","href":"/algorithms/graphs/iterative-and-iterators","docId":"graphs/iterative-and-iterators","unlisted":false},{"type":"link","label":"Distance boundaries from BFS tree on undirected graphs","href":"/algorithms/graphs/bfs-tree","docId":"graphs/bfs-tree","unlisted":false}],"href":"/algorithms/category/graphs"},{"type":"category","label":"Paths in Graphs","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"From BF to A*","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"BF","href":"/algorithms/paths/bf-to-astar/bf","docId":"paths/2024-01-01-bf-to-astar/bf","unlisted":false},{"type":"link","label":"Dijkstra\'s algorithm","href":"/algorithms/paths/bf-to-astar/dijkstra","docId":"paths/2024-01-01-bf-to-astar/dijkstra","unlisted":false},{"type":"link","label":"A* algorithm","href":"/algorithms/paths/bf-to-astar/astar","docId":"paths/2024-01-01-bf-to-astar/astar","unlisted":false}],"href":"/algorithms/paths/bf-to-astar"}],"href":"/algorithms/category/paths-in-graphs"},{"type":"category","label":"Hash Tables","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Breaking Hash Table","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Breaking Python","href":"/algorithms/hash-tables/breaking/python","docId":"hash-tables/2023-11-28-breaking/python","unlisted":false},{"type":"link","label":"Possible Mitigations","href":"/algorithms/hash-tables/breaking/mitigations","docId":"hash-tables/2023-11-28-breaking/mitigations","unlisted":false}],"href":"/algorithms/hash-tables/breaking"}],"href":"/algorithms/category/hash-tables"}]},"docs":{"algorithms-correctness/postcondition-ambiguity":{"id":"algorithms-correctness/postcondition-ambiguity","title":"Vague postconditions and proving correctness of algorithms","description":"Debugging and testing with precise postconditions.\\n","sidebar":"autogeneratedBar"},"algorithms-intro":{"id":"algorithms-intro","title":"Introduction","description":"In this part you can find \u201crandom\u201d additional materials I have written over the","sidebar":"autogeneratedBar"},"graphs/bfs-tree":{"id":"graphs/bfs-tree","title":"Distance boundaries from BFS tree on undirected graphs","description":"Short explanation of distance boundaries deduced from a BFS tree.\\n","sidebar":"autogeneratedBar"},"graphs/iterative-and-iterators":{"id":"graphs/iterative-and-iterators","title":"Iterative algorithms via iterators","description":"Iterative DFS using iterators.\\n","sidebar":"autogeneratedBar"},"hash-tables/2023-11-28-breaking/breaking":{"id":"hash-tables/2023-11-28-breaking/breaking","title":"Breaking Hash Table","description":"How to get the linear time complexity in a hash table.\\n","sidebar":"autogeneratedBar"},"hash-tables/2023-11-28-breaking/mitigations":{"id":"hash-tables/2023-11-28-breaking/mitigations","title":"Possible Mitigations","description":"Talking about the ways how to prevent the attacks on the hash table.\\n","sidebar":"autogeneratedBar"},"hash-tables/2023-11-28-breaking/python":{"id":"hash-tables/2023-11-28-breaking/python","title":"Breaking Python","description":"Actually getting the worst-case time complexity in Python.\\n","sidebar":"autogeneratedBar"},"paths/2024-01-01-bf-to-astar/astar":{"id":"paths/2024-01-01-bf-to-astar/astar","title":"A* algorithm","description":"Moving from Dijkstra\'s algorithm into the A* algorithm.\\n","sidebar":"autogeneratedBar"},"paths/2024-01-01-bf-to-astar/bf":{"id":"paths/2024-01-01-bf-to-astar/bf","title":"BF","description":"Solving the shortest path problem with a na\xefve approach that turns into\\nsomething.\\n","sidebar":"autogeneratedBar"},"paths/2024-01-01-bf-to-astar/dijkstra":{"id":"paths/2024-01-01-bf-to-astar/dijkstra","title":"Dijkstra\'s algorithm","description":"Moving from Bellman-Ford into the Dijsktra\'s algorithm.\\n","sidebar":"autogeneratedBar"},"paths/2024-01-01-bf-to-astar/index":{"id":"paths/2024-01-01-bf-to-astar/index","title":"From BF to A*","description":"Figuring out shortest-path problem from the BF to the A* algorithm.\\n","sidebar":"autogeneratedBar"},"rb-trees/applications":{"id":"rb-trees/applications","title":"Pou\u017eit\xed \u010derveno-\u010dern\xfdch strom\u016f","description":"Uk\xe1zka pou\u017eit\xed \u010derveno-\u010dern\xfdch strom\u016f v standardn\xedch kni\u017enic\xedch zn\xe1m\xfdch jazyk\u016f.\\n","sidebar":"autogeneratedBar"},"rb-trees/rules":{"id":"rb-trees/rules","title":"On the rules of the red-black tree","description":"Shower thoughts on the rules of the red-black tree.\\n","sidebar":"autogeneratedBar"},"recursion/2022-11-29-karel/karel":{"id":"recursion/2022-11-29-karel/karel","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","sidebar":"autogeneratedBar"},"recursion/2022-11-29-karel/solution":{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","sidebar":"autogeneratedBar"},"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp":{"id":"recursion/2023-08-17-pyramid-slide-down/bottom-up-dp","title":"Bottom-up DP solution","description":"Bottom-up DP solution of the Pyramid Slide Down.\\n","sidebar":"autogeneratedBar"},"recursion/2023-08-17-pyramid-slide-down/greedy":{"id":"recursion/2023-08-17-pyramid-slide-down/greedy","title":"Greedy solution","description":"Greedy solution of the Pyramid Slide Down.\\n","sidebar":"autogeneratedBar"},"recursion/2023-08-17-pyramid-slide-down/naive":{"id":"recursion/2023-08-17-pyramid-slide-down/naive","title":"Na\xefve solution","description":"Na\xefve solution of the Pyramid Slide Down.\\n","sidebar":"autogeneratedBar"},"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down":{"id":"recursion/2023-08-17-pyramid-slide-down/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","sidebar":"autogeneratedBar"},"recursion/2023-08-17-pyramid-slide-down/top-down-dp":{"id":"recursion/2023-08-17-pyramid-slide-down/top-down-dp","title":"Top-down DP solution","description":"Top-down DP solution of the Pyramid Slide Down.\\n","sidebar":"autogeneratedBar"},"time-complexity/extend":{"id":"time-complexity/extend","title":"Time complexity of \u2039extend\u203a","description":"How to make inefficient algorithm unknowingly.\\n","sidebar":"autogeneratedBar"}}}')}}]);