{"version":1,"pages":[{"id":"BOPsJXb8R6Fl010XR24Q","title":"Overview","pathname":"/","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Algorithms","icon":"atom"}]},{"id":"QggbK6KhUzPvX8MFbJXo","title":"Time Complexity","pathname":"/algorithms/time-complexity","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Algorithms","icon":"atom"}]},{"id":"J0CkmtmTOoOzACjafs4s","title":"Binary Search","pathname":"/algorithms/binary-search","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Algorithms","icon":"atom"}]},{"id":"V4WJA0c8sexNFjqlCIL4","title":"Sorting Algorithms","pathname":"/sorting-algorithms","siteSpaceId":"sitesp_eIJzz"},{"id":"t0s09paFMR4ysSpT7vxj","title":"Order Statistics","pathname":"/order-statistics","siteSpaceId":"sitesp_eIJzz","description":"Find the kth smallest element in an unsorted array"},{"id":"fCRSjDLFMcR03XYhhOYe","title":"Interval Searching","pathname":"/interval-searching","siteSpaceId":"sitesp_eIJzz","description":"Given an array of unsorted and possibly overlapping intervals, and a point, find an interval containing the point."},{"id":"9pbkVhDhHa6ZyPowYdLJ","title":"Orthogonal Range Queries","pathname":"/orthogonal-range-queries","siteSpaceId":"sitesp_eIJzz","description":"(1D-Version) Given an array of points and an interval, find the points (not just the number of points) that are contained the interval."},{"id":"rZ2loUXqsMiNVxJnJwcL","title":"Random Permutation Generation","pathname":"/random-permutation-generation","siteSpaceId":"sitesp_eIJzz","description":"Given an array A of  items, come up with an algorithm that produces a random permutation of A on every run"},{"id":"0JLTEDh5dU66VUaLrL8a","title":"Disjoint Set Union","pathname":"/disjoint-set-union","siteSpaceId":"sitesp_eIJzz","description":"Also known as Union Find Disjoint Set"},{"id":"88gtxa1IlL3Z50yi2Lo7","title":"Binary Search Tree","pathname":"/data-structures/binary-search-tree","siteSpaceId":"sitesp_eIJzz","description":"","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"qYcIoSzJ1WNLoToFSREW","title":"Trie","pathname":"/data-structures/trie","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"I9Liq9zy5jI3ap0v6QTe","title":"Hash (Symbol) Table","pathname":"/data-structures/hash-symbol-table","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"hAwpUzfZ0FrN7guSq6I2","title":"(a, b)-Trees","pathname":"/data-structures/a-b-trees","siteSpaceId":"sitesp_eIJzz","description":"","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"F2cpZrKpGldMBhdGKIlD","title":"(k, d)-Trees","pathname":"/data-structures/k-d-trees","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"NsLN8FE80q4Tmenbejfi","title":"Heap","pathname":"/data-structures/heap","siteSpaceId":"sitesp_eIJzz","description":"","breadcrumbs":[{"label":"Data Structures","icon":"tree-palm"}]},{"id":"WxCReRTr4VM6gTS0zd58","title":"Introduction","pathname":"/graphs/introduction","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"vmA6q42Y6VQcnHdWZ1qU","title":"BFS and DFS","pathname":"/graphs/bfs-and-dfs","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"mq5NplScPoaA51sgjt3u","title":"DAG and Topological Sort","pathname":"/graphs/dag-and-topological-sort","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"gvOD3nxVe3YaEwjFCu9L","title":"SCC (Tarjan's and Kosaraju's)","pathname":"/graphs/scc-tarjans-and-kosarajus","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"RWbwvjGCcGFKgL0iujSV","title":"SSSP (Bellman-Ford and Dijkstra)","pathname":"/graphs/sssp-bellman-ford-and-dijkstra","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"fLeUL80vX17Dw6oHaJfy","title":"MST (Prim's and Kruskal's)","pathname":"/graphs/mst-prims-and-kruskals","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Graphs","icon":"chart-network"}]},{"id":"nY2mcJP2OvI9BNxqQYUc","title":"Concept","pathname":"/dynamic-programming/concept","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]},{"id":"upP7QkA9AuDwE6T4juZk","title":"APSP Floyd-Warshall","pathname":"/dynamic-programming/apsp-floyd-warshall","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]},{"id":"rBqfkl5D2cbrxtasB4T6","title":"Longest Increasing Subsequence","pathname":"/dynamic-programming/longest-increasing-subsequence","siteSpaceId":"sitesp_eIJzz","description":"","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]},{"id":"AS33gP1Yt7fbhtweI9Tw","title":"0-1 Knapsack","pathname":"/dynamic-programming/0-1-knapsack","siteSpaceId":"sitesp_eIJzz","description":"","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]},{"id":"MtpVrNR0UIVdDlpQHc2R","title":"Prize Collecting","pathname":"/dynamic-programming/prize-collecting","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]},{"id":"6Y42Z49kr58i42qWm5vG","title":"Vertex Cover on a Tree","pathname":"/dynamic-programming/vertex-cover-on-a-tree","siteSpaceId":"sitesp_eIJzz","breadcrumbs":[{"label":"Dynamic Programming","icon":"border-all"}]}]}