This commit is contained in:
github-actions[bot] 2023-12-23 23:15:15 +00:00
parent c451cc79c2
commit 5caf50b240
141 changed files with 403 additions and 233 deletions

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

View file

@ -0,0 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[6342],{45443:i=>{i.exports=JSON.parse('{"label":"recursion","permalink":"/algorithms/tags/recursion","allTagsPath":"/algorithms/tags","count":4,"items":[{"id":"recursion/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"},{"id":"recursion/2022-11-29-karel/karel","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel"},{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","permalink":"/algorithms/recursion/karel/solution"},{"id":"time-complexity/extend","title":"Time complexity of \u2039extend\u203a","description":"How to make inefficient algorithm unknowingly.\\n","permalink":"/algorithms/time-complexity/extend"}],"unlisted":false}')}}]);

View file

@ -1 +0,0 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[6342],{45443:i=>{i.exports=JSON.parse('{"label":"recursion","permalink":"/algorithms/tags/recursion","allTagsPath":"/algorithms/tags","count":3,"items":[{"id":"recursion/pyramid-slide-down","title":"Introduction to dynamic programming","description":"Solving a problem in different ways.\\n","permalink":"/algorithms/recursion/pyramid-slide-down"},{"id":"recursion/karel-1","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel-1"},{"id":"time-complexity/extend","title":"Time complexity of \u2039extend\u203a","description":"How to make inefficient algorithm unknowingly.\\n","permalink":"/algorithms/time-complexity/extend"}],"unlisted":false}')}}]);

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

View file

@ -1 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9731],{42286:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>c,default:()=>d,frontMatter:()=>i,metadata:()=>s,toc:()=>p});var o=n(85893),r=n(11151);const i={id:"cpp-intro",title:"Introduction",slug:"/"},c=void 0,s={id:"cpp-intro",title:"Introduction",description:"",source:"@site/cpp/00-intro.md",sourceDirName:".",slug:"/",permalink:"/cpp/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/cpp/00-intro.md",tags:[],version:"current",lastUpdatedAt:1701271124,formattedLastUpdatedAt:"Nov 29, 2023",sidebarPosition:0,frontMatter:{id:"cpp-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Exceptions and RAII",permalink:"/cpp/category/exceptions-and-raii"}},a={},p=[];function u(t){return(0,o.jsx)(o.Fragment,{})}function d(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(u,{...t})}):u()}},11151:(t,e,n)=>{n.d(e,{Z:()=>s,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function s(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]); "use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9731],{42286:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>c,default:()=>d,frontMatter:()=>i,metadata:()=>s,toc:()=>p});var o=n(85893),r=n(11151);const i={id:"cpp-intro",title:"Introduction",slug:"/"},c=void 0,s={id:"cpp-intro",title:"Introduction",description:"",source:"@site/cpp/00-intro.md",sourceDirName:".",slug:"/",permalink:"/cpp/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/cpp/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703373170,formattedLastUpdatedAt:"Dec 23, 2023",sidebarPosition:0,frontMatter:{id:"cpp-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Exceptions and RAII",permalink:"/cpp/category/exceptions-and-raii"}},a={},p=[];function u(t){return(0,o.jsx)(o.Fragment,{})}function d(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(u,{...t})}):u()}},11151:(t,e,n)=>{n.d(e,{Z:()=>s,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function s(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

View file

@ -1 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3803],{86427:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>s,default:()=>l,frontMatter:()=>i,metadata:()=>c,toc:()=>u});var o=n(85893),r=n(11151);const i={id:"c-intro",title:"Introduction",slug:"/"},s=void 0,c={id:"c-intro",title:"Introduction",description:"",source:"@site/c/00-intro.md",sourceDirName:".",slug:"/",permalink:"/c/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/c/00-intro.md",tags:[],version:"current",lastUpdatedAt:1701271124,formattedLastUpdatedAt:"Nov 29, 2023",sidebarPosition:0,frontMatter:{id:"c-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Bonuses",permalink:"/c/category/bonuses"}},a={},u=[];function d(t){return(0,o.jsx)(o.Fragment,{})}function l(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(d,{...t})}):d()}},11151:(t,e,n)=>{n.d(e,{Z:()=>c,a:()=>s});var o=n(67294);const r={},i=o.createContext(r);function s(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function c(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:s(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]); "use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3803],{86427:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>a,contentTitle:()=>c,default:()=>l,frontMatter:()=>i,metadata:()=>s,toc:()=>u});var o=n(85893),r=n(11151);const i={id:"c-intro",title:"Introduction",slug:"/"},c=void 0,s={id:"c-intro",title:"Introduction",description:"",source:"@site/c/00-intro.md",sourceDirName:".",slug:"/",permalink:"/c/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/c/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703373170,formattedLastUpdatedAt:"Dec 23, 2023",sidebarPosition:0,frontMatter:{id:"c-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Bonuses",permalink:"/c/category/bonuses"}},a={},u=[];function d(t){return(0,o.jsx)(o.Fragment,{})}function l(t={}){const{wrapper:e}={...(0,r.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(d,{...t})}):d()}},11151:(t,e,n)=>{n.d(e,{Z:()=>s,a:()=>c});var o=n(67294);const r={},i=o.createContext(r);function c(t){const e=o.useContext(i);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function s(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(r):t.components||r:c(t.components),o.createElement(i.Provider,{value:e},t.children)}}}]);

View file

@ -0,0 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[6064],{12884:e=>{e.exports=JSON.parse('{"label":"solution","permalink":"/algorithms/tags/solution","allTagsPath":"/algorithms/tags","count":1,"items":[{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","permalink":"/algorithms/recursion/karel/solution"}],"unlisted":false}')}}]);

View file

@ -1 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1885],{49713:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>c,contentTitle:()=>i,default:()=>u,frontMatter:()=>r,metadata:()=>a,toc:()=>d});var o=n(85893),s=n(11151);const r={id:"algorithms-intro",title:"Introduction",slug:"/"},i=void 0,a={id:"algorithms-intro",title:"Introduction",description:"In this part you can find \u201crandom\u201d additional materials I have written over the",source:"@site/algorithms/00-intro.md",sourceDirName:".",slug:"/",permalink:"/algorithms/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/algorithms/00-intro.md",tags:[],version:"current",lastUpdatedAt:1701271124,formattedLastUpdatedAt:"Nov 29, 2023",sidebarPosition:0,frontMatter:{id:"algorithms-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Algorithms and Correctness",permalink:"/algorithms/category/algorithms-and-correctness"}},c={},d=[];function l(t){const e={a:"a",em:"em",p:"p",...(0,s.a)(),...t.components};return(0,o.jsxs)(o.Fragment,{children:[(0,o.jsxs)(e.p,{children:["In this part you can find \u201crandom\u201d additional materials I have written over the\ncourse of teaching ",(0,o.jsx)(e.em,{children:"Algorithms and data structures I"}),"."]}),"\n",(0,o.jsx)(e.p,{children:"It is a various mix of stuff that may have been produced as a follow-up on some\nquestion asked at the seminar or spontanously."}),"\n",(0,o.jsxs)(e.p,{children:["If you have some ideas for posts, please do not hesitate to submit them as issues\nin the linked ",(0,o.jsx)(e.a,{href:"https://gitlab.fi.muni.cz/xfocko/kb/issues",children:"GitLab"}),"."]})]})}function u(t={}){const{wrapper:e}={...(0,s.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(l,{...t})}):l(t)}},11151:(t,e,n)=>{n.d(e,{Z:()=>a,a:()=>i});var o=n(67294);const s={},r=o.createContext(s);function i(t){const e=o.useContext(r);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function a(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(s):t.components||s:i(t.components),o.createElement(r.Provider,{value:e},t.children)}}}]); "use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1885],{49713:(t,e,n)=>{n.r(e),n.d(e,{assets:()=>c,contentTitle:()=>i,default:()=>u,frontMatter:()=>r,metadata:()=>a,toc:()=>d});var o=n(85893),s=n(11151);const r={id:"algorithms-intro",title:"Introduction",slug:"/"},i=void 0,a={id:"algorithms-intro",title:"Introduction",description:"In this part you can find \u201crandom\u201d additional materials I have written over the",source:"@site/algorithms/00-intro.md",sourceDirName:".",slug:"/",permalink:"/algorithms/",draft:!1,unlisted:!1,editUrl:"https://github.com/mfocko/blog/tree/main/algorithms/00-intro.md",tags:[],version:"current",lastUpdatedAt:1703373170,formattedLastUpdatedAt:"Dec 23, 2023",sidebarPosition:0,frontMatter:{id:"algorithms-intro",title:"Introduction",slug:"/"},sidebar:"autogeneratedBar",next:{title:"Algorithms and Correctness",permalink:"/algorithms/category/algorithms-and-correctness"}},c={},d=[];function l(t){const e={a:"a",em:"em",p:"p",...(0,s.a)(),...t.components};return(0,o.jsxs)(o.Fragment,{children:[(0,o.jsxs)(e.p,{children:["In this part you can find \u201crandom\u201d additional materials I have written over the\ncourse of teaching ",(0,o.jsx)(e.em,{children:"Algorithms and data structures I"}),"."]}),"\n",(0,o.jsx)(e.p,{children:"It is a various mix of stuff that may have been produced as a follow-up on some\nquestion asked at the seminar or spontanously."}),"\n",(0,o.jsxs)(e.p,{children:["If you have some ideas for posts, please do not hesitate to submit them as issues\nin the linked ",(0,o.jsx)(e.a,{href:"https://gitlab.fi.muni.cz/xfocko/kb/issues",children:"GitLab"}),"."]})]})}function u(t={}){const{wrapper:e}={...(0,s.a)(),...t.components};return e?(0,o.jsx)(e,{...t,children:(0,o.jsx)(l,{...t})}):l(t)}},11151:(t,e,n)=>{n.d(e,{Z:()=>a,a:()=>i});var o=n(67294);const s={},r=o.createContext(s);function i(t){const e=o.useContext(r);return o.useMemo((function(){return"function"==typeof t?t(e):{...e,...t}}),[e,t])}function a(t){let e;return e=t.disableParentContext?"function"==typeof t.components?t.components(s):t.components||s:i(t.components),o.createElement(r.Provider,{value:e},t.children)}}}]);

View file

@ -1 +0,0 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9066],{72232:t=>{t.exports=JSON.parse('{"label":"python","permalink":"/algorithms/tags/python","allTagsPath":"/algorithms/tags","count":6,"items":[{"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","permalink":"/algorithms/hash-tables/breaking"},{"id":"hash-tables/2023-11-28-breaking/python","title":"Breaking Python","description":"Actually getting the worst-case time complexity in Python.\\n","permalink":"/algorithms/hash-tables/breaking/python"},{"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","permalink":"/algorithms/hash-tables/breaking/mitigations"},{"id":"recursion/karel-1","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel-1"},{"id":"time-complexity/extend","title":"Time complexity of \u2039extend\u203a","description":"How to make inefficient algorithm unknowingly.\\n","permalink":"/algorithms/time-complexity/extend"},{"id":"algorithms-correctness/postcondition-ambiguity","title":"Vague postconditions and proving correctness of algorithms","description":"Debugging and testing with precise postconditions.\\n","permalink":"/algorithms/algorithms-correctness/postcondition-ambiguity"}],"unlisted":false}')}}]);

View file

@ -0,0 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[9066],{72232:i=>{i.exports=JSON.parse('{"label":"python","permalink":"/algorithms/tags/python","allTagsPath":"/algorithms/tags","count":7,"items":[{"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","permalink":"/algorithms/hash-tables/breaking"},{"id":"hash-tables/2023-11-28-breaking/python","title":"Breaking Python","description":"Actually getting the worst-case time complexity in Python.\\n","permalink":"/algorithms/hash-tables/breaking/python"},{"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","permalink":"/algorithms/hash-tables/breaking/mitigations"},{"id":"recursion/2022-11-29-karel/karel","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel"},{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","permalink":"/algorithms/recursion/karel/solution"},{"id":"time-complexity/extend","title":"Time complexity of \u2039extend\u203a","description":"How to make inefficient algorithm unknowingly.\\n","permalink":"/algorithms/time-complexity/extend"},{"id":"algorithms-correctness/postcondition-ambiguity","title":"Vague postconditions and proving correctness of algorithms","description":"Debugging and testing with precise postconditions.\\n","permalink":"/algorithms/algorithms-correctness/postcondition-ambiguity"}],"unlisted":false}')}}]);

View file

@ -1 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3887],{7405:e=>{e.exports=JSON.parse('{"title":"Recursion","description":"Materials related to recursive algorithms and their time complexity.\\n","slug":"/category/recursion","permalink":"/algorithms/category/recursion","navigation":{"previous":{"title":"Time complexity of \u2039extend\u203a","permalink":"/algorithms/time-complexity/extend"},"next":{"title":"Recursion and backtracking with Robot Karel","permalink":"/algorithms/recursion/karel-1"}}}')}}]); "use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[3887],{7405:e=>{e.exports=JSON.parse('{"title":"Recursion","description":"Materials related to recursive algorithms and their time complexity.\\n","slug":"/category/recursion","permalink":"/algorithms/category/recursion","navigation":{"previous":{"title":"Time complexity of \u2039extend\u203a","permalink":"/algorithms/time-complexity/extend"},"next":{"title":"Recursion and backtracking with Robot Karel","permalink":"/algorithms/recursion/karel"}}}')}}]);

View file

@ -1 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1464],{77343:a=>{a.exports=JSON.parse('[{"label":"python","permalink":"/algorithms/tags/python","count":6},{"label":"testing","permalink":"/algorithms/tags/testing","count":1},{"label":"postconditions","permalink":"/algorithms/tags/postconditions","count":1},{"label":"sorting","permalink":"/algorithms/tags/sorting","count":1},{"label":"graphs","permalink":"/algorithms/tags/graphs","count":2},{"label":"bfs","permalink":"/algorithms/tags/bfs","count":1},{"label":"csharp","permalink":"/algorithms/tags/csharp","count":1},{"label":"iterators","permalink":"/algorithms/tags/iterators","count":1},{"label":"iterative","permalink":"/algorithms/tags/iterative","count":1},{"label":"cpp","permalink":"/algorithms/tags/cpp","count":3},{"label":"hash-tables","permalink":"/algorithms/tags/hash-tables","count":3},{"label":"balanced trees","permalink":"/algorithms/tags/balanced-trees","count":2},{"label":"red-black trees","permalink":"/algorithms/tags/red-black-trees","count":2},{"label":"applications","permalink":"/algorithms/tags/applications","count":1},{"label":"karel","permalink":"/algorithms/tags/karel","count":1},{"label":"recursion","permalink":"/algorithms/tags/recursion","count":3},{"label":"backtracking","permalink":"/algorithms/tags/backtracking","count":1},{"label":"java","permalink":"/algorithms/tags/java","count":1},{"label":"exponential","permalink":"/algorithms/tags/exponential","count":1},{"label":"greedy","permalink":"/algorithms/tags/greedy","count":1},{"label":"dynamic-programming","permalink":"/algorithms/tags/dynamic-programming","count":1},{"label":"top-down-dp","permalink":"/algorithms/tags/top-down-dp","count":1},{"label":"bottom-up-dp","permalink":"/algorithms/tags/bottom-up-dp","count":1},{"label":"c","permalink":"/algorithms/tags/c","count":1},{"label":"dynamic array","permalink":"/algorithms/tags/dynamic-array","count":1},{"label":"time complexity","permalink":"/algorithms/tags/time-complexity","count":1}]')}}]); "use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[1464],{77343:a=>{a.exports=JSON.parse('[{"label":"python","permalink":"/algorithms/tags/python","count":7},{"label":"testing","permalink":"/algorithms/tags/testing","count":1},{"label":"postconditions","permalink":"/algorithms/tags/postconditions","count":1},{"label":"sorting","permalink":"/algorithms/tags/sorting","count":1},{"label":"graphs","permalink":"/algorithms/tags/graphs","count":2},{"label":"bfs","permalink":"/algorithms/tags/bfs","count":1},{"label":"csharp","permalink":"/algorithms/tags/csharp","count":1},{"label":"iterators","permalink":"/algorithms/tags/iterators","count":1},{"label":"iterative","permalink":"/algorithms/tags/iterative","count":1},{"label":"cpp","permalink":"/algorithms/tags/cpp","count":3},{"label":"hash-tables","permalink":"/algorithms/tags/hash-tables","count":3},{"label":"balanced trees","permalink":"/algorithms/tags/balanced-trees","count":2},{"label":"red-black trees","permalink":"/algorithms/tags/red-black-trees","count":2},{"label":"applications","permalink":"/algorithms/tags/applications","count":1},{"label":"karel","permalink":"/algorithms/tags/karel","count":2},{"label":"recursion","permalink":"/algorithms/tags/recursion","count":4},{"label":"backtracking","permalink":"/algorithms/tags/backtracking","count":2},{"label":"solution","permalink":"/algorithms/tags/solution","count":1},{"label":"java","permalink":"/algorithms/tags/java","count":1},{"label":"exponential","permalink":"/algorithms/tags/exponential","count":1},{"label":"greedy","permalink":"/algorithms/tags/greedy","count":1},{"label":"dynamic-programming","permalink":"/algorithms/tags/dynamic-programming","count":1},{"label":"top-down-dp","permalink":"/algorithms/tags/top-down-dp","count":1},{"label":"bottom-up-dp","permalink":"/algorithms/tags/bottom-up-dp","count":1},{"label":"c","permalink":"/algorithms/tags/c","count":1},{"label":"dynamic array","permalink":"/algorithms/tags/dynamic-array","count":1},{"label":"time complexity","permalink":"/algorithms/tags/time-complexity","count":1}]')}}]);

File diff suppressed because one or more lines are too long

View file

@ -1 +0,0 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[6864],{82505:e=>{e.exports=JSON.parse('{"label":"karel","permalink":"/algorithms/tags/karel","allTagsPath":"/algorithms/tags","count":1,"items":[{"id":"recursion/karel-1","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel-1"}],"unlisted":false}')}}]);

View file

@ -0,0 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[6864],{82505:e=>{e.exports=JSON.parse('{"label":"karel","permalink":"/algorithms/tags/karel","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"recursion/2022-11-29-karel/karel","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel"},{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","permalink":"/algorithms/recursion/karel/solution"}],"unlisted":false}')}}]);

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

View file

@ -1 +0,0 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8387],{47662:a=>{a.exports=JSON.parse('{"label":"backtracking","permalink":"/algorithms/tags/backtracking","allTagsPath":"/algorithms/tags","count":1,"items":[{"id":"recursion/karel-1","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel-1"}],"unlisted":false}')}}]);

View file

@ -0,0 +1 @@
"use strict";(self.webpackChunkfi=self.webpackChunkfi||[]).push([[8387],{47662:i=>{i.exports=JSON.parse('{"label":"backtracking","permalink":"/algorithms/tags/backtracking","allTagsPath":"/algorithms/tags","count":2,"items":[{"id":"recursion/2022-11-29-karel/karel","title":"Recursion and backtracking with Robot Karel","description":"A problem with too many restrictions.\\n","permalink":"/algorithms/recursion/karel"},{"id":"recursion/2022-11-29-karel/solution","title":"Solution to the problem","description":"Solving the problem introduced in the previous post.\\n","permalink":"/algorithms/recursion/karel/solution"}],"unlisted":false}')}}]);

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

File diff suppressed because one or more lines are too long

Some files were not shown because too many files have changed in this diff Show more