{"version":1,"pages":[{"id":"-M6lfYncA3ZB-tsNPNKi","title":"This site is now deprecated","pathname":"/","siteSpaceId":"sitesp_INhA5","description":""},{"id":"-M6lpZPtUOK5qdEVO-j5","title":"Inheritance","pathname":"/oop/inheritance","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Object Oriented Programming"}]},{"id":"-M6lpZPnvH_XdDOyZ2Ab","title":"Access Control","pathname":"/oop/access-control","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Object Oriented Programming"}]},{"id":"-M6pcVgcVwbsL99Ews7B","title":"Dynamic Method Selection","pathname":"/oop/dynamic-method-selection","siteSpaceId":"sitesp_INhA5","description":"ft. Doge and RarePupper","breadcrumbs":[{"label":"Object Oriented Programming"}]},{"id":"-M6lpZPlg03DLahREy-1","title":"Java Objects","pathname":"/oop/objects","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Object Oriented Programming"}]},{"id":"-M6lpZPhpRukYShoDIxQ","title":"Generic Types","pathname":"/oop/generics","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Object Oriented Programming"}]},{"id":"-M6lpZPsUWvse1SyzAfq","title":"Asymptotic Analysis Basics","pathname":"/asymptotics/asymptotics","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Asymptotics"}]},{"id":"-M6lpZPgK_khvjUov8J5","title":"Amortization","pathname":"/asymptotics/amortization","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Asymptotics"}]},{"id":"-M6vrn3S4OB4m-gy-uVC","title":"Asymptotics Practice","pathname":"/asymptotics/asymptotics-practice","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Asymptotics"}]},{"id":"-M6lpZPkYeWCrWEAkGI9","title":"Collections","pathname":"/abstract-data-types/collections","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M6lpZPiyBA9C9wIDoJE","title":"Arrays","pathname":"/abstract-data-types/collections/arrays","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Collections"}]},{"id":"-M6lpZPeIAUWecjIiJaB","title":"Linked Lists","pathname":"/abstract-data-types/collections/linked-lists","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Collections"}]},{"id":"-M6lpZPptGeOpdT23NPQ","title":"Sets","pathname":"/abstract-data-types/collections/sets","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Collections"}]},{"id":"-M6mduduO4VT_QHGbGWa","title":"Stacks and Queues","pathname":"/abstract-data-types/collections/stacks-and-queues","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Collections"}]},{"id":"-M6lpZPuLJbh1wrOYy6w","title":"Binary Trees","pathname":"/abstract-data-types/binary-trees","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M7-6EdlqMSr7IUr7St9","title":"Heaps","pathname":"/abstract-data-types/binary-trees/heaps","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Binary Trees"}]},{"id":"-M6lpZPfTDC4g4A4RUjX","title":"Balanced BSTs","pathname":"/abstract-data-types/binary-trees/balanced-search-structures","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Binary Trees"}]},{"id":"-M6lpZPjpGxkmz0WhlMX","title":"Tries","pathname":"/abstract-data-types/binary-trees/tries","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"},{"label":"Binary Trees"}]},{"id":"-M6lpZPbmMXYllFyxHuC","title":"Graphs","pathname":"/abstract-data-types/graphs","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M6lpZPmIuKewoSA_0nD","title":"Hashing and Hash Tables","pathname":"/abstract-data-types/hashing","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M6mgHz4i4zhwIhVWLJT","title":"Union Find (Disjoint Sets)","pathname":"/abstract-data-types/union-find-disjoint-sets","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M6pZk9S8K0bYJMSt591","title":"Comparables and Comparators","pathname":"/abstract-data-types/comparables-and-comparators","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Abstract Data Types"}]},{"id":"-M6lpZPdrSHUJVIpBRIp","title":"Sorting","pathname":"/sorting/sorting-basics","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Sorting"}]},{"id":"-M6mZWXd8yeMYYG0-biA","title":"Minimax Algorithm","pathname":"/algorithms/minimax","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"-M6mcAk6Z_lqGNO0MaGu","title":"Searching","pathname":"/algorithms/searching","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"-M6mcEgtxRtSh29zVONf","title":"Binary Search","pathname":"/algorithms/searching/binary-search","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"},{"label":"Searching"}]},{"id":"-M6mb_e4-HLKxoaS6IGY","title":"Depth First Search (DFS)","pathname":"/algorithms/searching/depth-first-search-dfs","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"},{"label":"Searching"}]},{"id":"-M6mbfH9ohs44dzwpNR2","title":"Breadth First Search (BFS)","pathname":"/algorithms/searching/breadth-first-search-bfs","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"},{"label":"Searching"}]},{"id":"-M6mbzI_6frt_qt9jTFN","title":"Shortest Paths","pathname":"/algorithms/shortest-paths","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"-M6mc2bGKwVYn0NA9-oL","title":"Dijkstra's Algorithm","pathname":"/algorithms/shortest-paths/dijkstras-algorithm","siteSpaceId":"sitesp_INhA5","description":"Special thanks to Arin for writing this page!","breadcrumbs":[{"label":"Algorithms"},{"label":"Shortest Paths"}]},{"id":"-M6mc5TCbx_gq7wbsvrm","title":"A* Search","pathname":"/algorithms/shortest-paths/a-search","siteSpaceId":"sitesp_INhA5","description":"Special thanks to Arin for writing this page!","breadcrumbs":[{"label":"Algorithms"},{"label":"Shortest Paths"}]},{"id":"-M6mblESwhKypvd0KnPP","title":"Minimum Spanning Trees","pathname":"/algorithms/minimum-spanning-trees","siteSpaceId":"sitesp_INhA5","description":"Special thanks to Arin for writing this page!","breadcrumbs":[{"label":"Algorithms"}]},{"id":"-M6mbsZ_6GbgTur0c6wd","title":"Prim's Algorithm","pathname":"/algorithms/minimum-spanning-trees/prims-algorithm","siteSpaceId":"sitesp_INhA5","description":"Special thanks to Arin for writing this page!","breadcrumbs":[{"label":"Algorithms"},{"label":"Minimum Spanning Trees"}]},{"id":"-M6mbwJp_VDTMMdWAdBj","title":"Kruskal's Algorithm","pathname":"/algorithms/minimum-spanning-trees/kruskals-algorithm","siteSpaceId":"sitesp_INhA5","description":"Special thanks to Arin for writing this page!","breadcrumbs":[{"label":"Algorithms"},{"label":"Minimum Spanning Trees"}]},{"id":"-M6lpZPr8dFD-LZ3KBcw","title":"Modular Arithmetic and Bit Manipulation","pathname":"/misc-topics/modular-arithmetic","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Misc Topics"}]},{"id":"-M6lpZPcWBAs0lGxA-Ri","title":"Exceptions","pathname":"/misc-topics/exceptions","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Misc Topics"}]},{"id":"-M6pNgz7kWGmFsKdETHZ","title":"More Resources","pathname":"/misc-topics/more-resources","siteSpaceId":"sitesp_INhA5","description":"","breadcrumbs":[{"label":"Misc Topics"}]}]}