leetcode/docs/site.json

{
  "folders": {
    "(01-linear-structures)": {
      "title": "1. Linear Structures",
      "order": 1
    },
    "(01-linear-structures)/binary-search": {
      "title": "Binary Search",
      "order": 5,
      "icon": "search",
      "display": "page"
    },
    "(01-linear-structures)/hash-table": {
      "title": "Hash Table",
      "order": 1,
      "icon": "hash",
      "display": "page"
    },
    "(01-linear-structures)/monotonic-stack": {
      "title": "Monotonic Stack",
      "order": 7,
      "icon": "trending-up",
      "display": "page"
    },
    "(01-linear-structures)/prefix-sum": {
      "title": "Prefix Sum",
      "order": 2,
      "icon": "sigma",
      "display": "page"
    },
    "(01-linear-structures)/sliding-window": {
      "title": "Sliding Window",
      "order": 4,
      "icon": "app-window",
      "display": "page"
    },
    "(01-linear-structures)/stack": {
      "title": "Stack",
      "order": 6,
      "icon": "layers",
      "display": "page"
    },
    "(01-linear-structures)/two-pointers": {
      "title": "Two Pointers",
      "order": 3,
      "icon": "arrow-left-right",
      "display": "page"
    },
    "(02-nodal-grid)": {
      "title": "2. Nodal & Grid",
      "order": 2
    },
    "(02-nodal-grid)/hybrid-structures": {
      "title": "Hybrid Structures",
      "order": 9,
      "icon": "combine",
      "display": "page"
    },
    "(02-nodal-grid)/linked-list": {
      "title": "Linked List",
      "order": 8,
      "icon": "link",
      "display": "page"
    },
    "(02-nodal-grid)/matrix-index-math": {
      "title": "Matrix Index Math",
      "order": 10,
      "icon": "grid-3x3",
      "display": "page"
    },
    "(03-hierarchical)": {
      "title": "3. Hierarchical",
      "order": 3
    },
    "(03-hierarchical)/binary-search-tree": {
      "title": "Binary Search Tree",
      "order": 13,
      "icon": "git-fork",
      "display": "page"
    },
    "(03-hierarchical)/heap-priority-queue": {
      "title": "Heap / Priority Queue",
      "order": 14,
      "icon": "triangle",
      "display": "page"
    },
    "(03-hierarchical)/tree-bfs": {
      "title": "Tree BFS",
      "order": 12,
      "icon": "network",
      "display": "page"
    },
    "(03-hierarchical)/tree-dfs": {
      "title": "Tree DFS",
      "order": 11,
      "icon": "folder-tree",
      "display": "page"
    },
    "(03-hierarchical)/trie": {
      "title": "Trie",
      "order": 15,
      "icon": "spell-check",
      "display": "page"
    },
    "(04-relational)": {
      "title": "4. Relational",
      "order": 4
    },
    "(04-relational)/graph-bfs": {
      "title": "Graph BFS",
      "order": 17,
      "icon": "radar",
      "display": "page"
    },
    "(04-relational)/graph-dfs": {
      "title": "Graph DFS",
      "order": 16,
      "icon": "waypoints",
      "display": "page"
    },
    "(04-relational)/topological-sort": {
      "title": "Topological Sort",
      "order": 18,
      "icon": "workflow",
      "display": "page"
    },
    "(04-relational)/union-find": {
      "title": "Union-Find",
      "order": 19,
      "icon": "merge",
      "display": "page"
    },
    "(05-decision-space)": {
      "title": "5. Decision Space",
      "order": 5
    },
    "(05-decision-space)/1d-dynamic-programming": {
      "title": "1-D Dynamic Programming",
      "order": 21,
      "icon": "columns-3",
      "display": "page"
    },
    "(05-decision-space)/backtracking": {
      "title": "Backtracking",
      "order": 20,
      "icon": "undo-2",
      "display": "page"
    },
    "(05-decision-space)/greedy": {
      "title": "Greedy",
      "order": 23,
      "icon": "coins",
      "display": "page"
    },
    "(05-decision-space)/intervals": {
      "title": "Intervals",
      "order": 24,
      "icon": "calendar-range",
      "display": "page"
    },
    "(05-decision-space)/multi-d-grid-dp": {
      "title": "Multi-D / Grid DP",
      "order": 22,
      "icon": "table",
      "display": "page"
    }
  },
  "redirects": [
    {
      "from": "/1",
      "to": "/hash-table/two-sum"
    },
    {
      "from": "/2",
      "to": "/hybrid-structures/add-two-numbers"
    },
    {
      "from": "/3",
      "to": "/sliding-window/longest-substring-without-repeating-characters"
    },
    {
      "from": "/11",
      "to": "/two-pointers/container-with-most-water"
    },
    {
      "from": "/15",
      "to": "/two-pointers/3sum"
    },
    {
      "from": "/20",
      "to": "/stack/valid-parentheses"
    },
    {
      "from": "/21",
      "to": "/linked-list/merge-two-sorted-lists"
    },
    {
      "from": "/23",
      "to": "/heap-priority-queue/merge-k-sorted-lists"
    },
    {
      "from": "/33",
      "to": "/binary-search/search-in-rotated-sorted-array"
    },
    {
      "from": "/34",
      "to": "/binary-search/find-first-and-last-position-of-element-in-sorted-array"
    },
    {
      "from": "/35",
      "to": "/binary-search/search-insert-position"
    },
    {
      "from": "/39",
      "to": "/backtracking/combination-sum"
    },
    {
      "from": "/42",
      "to": "/two-pointers/trapping-rain-water"
    },
    {
      "from": "/46",
      "to": "/backtracking/permutations"
    },
    {
      "from": "/48",
      "to": "/matrix-index-math/rotate-image"
    },
    {
      "from": "/49",
      "to": "/hash-table/group-anagrams"
    },
    {
      "from": "/53",
      "to": "/greedy/maximum-subarray"
    },
    {
      "from": "/54",
      "to": "/matrix-index-math/spiral-matrix"
    },
    {
      "from": "/55",
      "to": "/greedy/jump-game"
    },
    {
      "from": "/56",
      "to": "/intervals/merge-intervals"
    },
    {
      "from": "/57",
      "to": "/intervals/insert-interval"
    },
    {
      "from": "/62",
      "to": "/multi-d-grid-dp/unique-paths"
    },
    {
      "from": "/64",
      "to": "/multi-d-grid-dp/minimum-path-sum"
    },
    {
      "from": "/70",
      "to": "/1d-dynamic-programming/climbing-stairs"
    },
    {
      "from": "/71",
      "to": "/stack/simplify-path"
    },
    {
      "from": "/73",
      "to": "/matrix-index-math/set-matrix-zeroes"
    },
    {
      "from": "/74",
      "to": "/binary-search/search-a-2d-matrix"
    },
    {
      "from": "/78",
      "to": "/backtracking/subsets"
    },
    {
      "from": "/98",
      "to": "/binary-search-tree/validate-binary-search-tree"
    },
    {
      "from": "/102",
      "to": "/tree-bfs/binary-tree-level-order-traversal"
    },
    {
      "from": "/104",
      "to": "/tree-dfs/maximum-depth-of-binary-tree"
    },
    {
      "from": "/121",
      "to": "/sliding-window/best-time-to-buy-and-sell-stock"
    },
    {
      "from": "/125",
      "to": "/two-pointers/valid-palindrome"
    },
    {
      "from": "/127",
      "to": "/graph-bfs/word-ladder"
    },
    {
      "from": "/128",
      "to": "/hash-table/longest-consecutive-sequence"
    },
    {
      "from": "/133",
      "to": "/graph-dfs/clone-graph"
    },
    {
      "from": "/134",
      "to": "/greedy/gas-station"
    },
    {
      "from": "/141",
      "to": "/linked-list/linked-list-cycle"
    },
    {
      "from": "/146",
      "to": "/hybrid-structures/lru-cache"
    },
    {
      "from": "/150",
      "to": "/stack/evaluate-reverse-polish-notation"
    },
    {
      "from": "/153",
      "to": "/binary-search/find-minimum-in-rotated-sorted-array"
    },
    {
      "from": "/155",
      "to": "/stack/min-stack"
    },
    {
      "from": "/162",
      "to": "/binary-search/find-peak-element"
    },
    {
      "from": "/167",
      "to": "/two-pointers/two-sum-ii-input-array-is-sorted"
    },
    {
      "from": "/189",
      "to": "/two-pointers/rotate-array"
    },
    {
      "from": "/198",
      "to": "/1d-dynamic-programming/house-robber"
    },
    {
      "from": "/199",
      "to": "/tree-bfs/binary-tree-right-side-view"
    },
    {
      "from": "/200",
      "to": "/graph-dfs/number-of-islands"
    },
    {
      "from": "/205",
      "to": "/hash-table/isomorphic-strings"
    },
    {
      "from": "/206",
      "to": "/linked-list/reverse-linked-list"
    },
    {
      "from": "/207",
      "to": "/topological-sort/course-schedule"
    },
    {
      "from": "/208",
      "to": "/trie/implement-trie-prefix-tree"
    },
    {
      "from": "/209",
      "to": "/sliding-window/minimum-size-subarray-sum"
    },
    {
      "from": "/210",
      "to": "/topological-sort/course-schedule-ii"
    },
    {
      "from": "/211",
      "to": "/trie/design-add-and-search-words-data-structure"
    },
    {
      "from": "/215",
      "to": "/heap-priority-queue/kth-largest-element-in-an-array"
    },
    {
      "from": "/217",
      "to": "/hash-table/contains-duplicate"
    },
    {
      "from": "/226",
      "to": "/tree-dfs/invert-binary-tree"
    },
    {
      "from": "/230",
      "to": "/binary-search-tree/kth-smallest-element-in-a-bst"
    },
    {
      "from": "/235",
      "to": "/binary-search-tree/lowest-common-ancestor-of-a-binary-search-tree"
    },
    {
      "from": "/236",
      "to": "/tree-dfs/lowest-common-ancestor-of-a-binary-tree"
    },
    {
      "from": "/238",
      "to": "/prefix-sum/product-of-array-except-self"
    },
    {
      "from": "/242",
      "to": "/hash-table/valid-anagram"
    },
    {
      "from": "/290",
      "to": "/hash-table/word-pattern"
    },
    {
      "from": "/303",
      "to": "/prefix-sum/range-sum-query-immutable"
    },
    {
      "from": "/322",
      "to": "/1d-dynamic-programming/coin-change"
    },
    {
      "from": "/323",
      "to": "/union-find/number-of-connected-components-in-an-undirected-graph"
    },
    {
      "from": "/344",
      "to": "/two-pointers/reverse-string"
    },
    {
      "from": "/347",
      "to": "/hash-table/top-k-frequent-elements"
    },
    {
      "from": "/387",
      "to": "/hash-table/first-unique-character-in-a-string"
    },
    {
      "from": "/392",
      "to": "/two-pointers/is-subsequence"
    },
    {
      "from": "/417",
      "to": "/graph-dfs/pacific-atlantic-water-flow"
    },
    {
      "from": "/424",
      "to": "/sliding-window/longest-repeating-character-replacement"
    },
    {
      "from": "/435",
      "to": "/intervals/non-overlapping-intervals"
    },
    {
      "from": "/451",
      "to": "/hash-table/sort-characters-by-frequency"
    },
    {
      "from": "/525",
      "to": "/prefix-sum/contiguous-array"
    },
    {
      "from": "/560",
      "to": "/prefix-sum/subarray-sum-equals-k"
    },
    {
      "from": "/567",
      "to": "/sliding-window/permutation-in-string"
    },
    {
      "from": "/643",
      "to": "/sliding-window/maximum-average-subarray-i"
    },
    {
      "from": "/684",
      "to": "/union-find/redundant-connection"
    },
    {
      "from": "/704",
      "to": "/binary-search/binary-search"
    },
    {
      "from": "/739",
      "to": "/monotonic-stack/daily-temperatures"
    },
    {
      "from": "/853",
      "to": "/monotonic-stack/car-fleet"
    },
    {
      "from": "/875",
      "to": "/binary-search/koko-eating-bananas"
    },
    {
      "from": "/973",
      "to": "/heap-priority-queue/k-closest-points-to-origin"
    },
    {
      "from": "/974",
      "to": "/prefix-sum/subarray-sums-divisible-by-k"
    },
    {
      "from": "/977",
      "to": "/two-pointers/squares-of-a-sorted-array"
    },
    {
      "from": "/994",
      "to": "/graph-bfs/rotting-oranges"
    },
    {
      "from": "/1004",
      "to": "/sliding-window/max-consecutive-ones-iii"
    },
    {
      "from": "/1143",
      "to": "/multi-d-grid-dp/longest-common-subsequence"
    },
    {
      "from": "/1448",
      "to": "/tree-bfs/count-good-nodes-in-binary-tree"
    },
    {
      "from": "/1832",
      "to": "/hash-table/check-if-the-sentence-is-pangram"
    }
  ]
}