From bfeadc0cdfc57e0a904ce95d68d4079a03c4cc01 Mon Sep 17 00:00:00 2001 From: Prad Nukala Date: Thu, 24 Sep 2026 16:15:55 -0400 Subject: [PATCH] docs(docs): add generated short URL redirects for LeetCode problem pages --- apps/docs/redirects.ts | 71 ++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 apps/docs/redirects.ts diff --git a/apps/docs/redirects.ts b/apps/docs/redirects.ts new file mode 100644 index 0000000..5a2c90e --- /dev/null +++ b/apps/docs/redirects.ts @@ -0,0 +1,71 @@ +// Generated by `bun run sync` (apps/cli/sync.ts) — do not edit. +// `/leetcode/` → that problem's page; exact paths, base added by Blume. +export default [ + { 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: "/35", to: "/binary-search/search-insert-position" }, + { from: "/39", to: "/backtracking/combination-sum" }, + { from: "/46", to: "/backtracking/permutations" }, + { from: "/48", to: "/matrix-index-math/rotate-image" }, + { from: "/49", to: "/hash-table/group-anagrams" }, + { from: "/54", to: "/matrix-index-math/spiral-matrix" }, + { 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: "/133", to: "/graph-dfs/clone-graph" }, + { 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: "/167", to: "/two-pointers/two-sum-ii-input-array-is-sorted" }, + { from: "/199", to: "/tree-bfs/binary-tree-right-side-view" }, + { from: "/200", to: "/graph-dfs/number-of-islands" }, + { from: "/206", to: "/linked-list/reverse-linked-list" }, + { from: "/207", to: "/topological-sort/course-schedule" }, + { from: "/208", to: "/trie/implement-trie-prefix-tree" }, + { 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: "/303", to: "/prefix-sum/range-sum-query-immutable" }, + { 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: "/451", to: "/hash-table/sort-characters-by-frequency" }, + { from: "/560", to: "/prefix-sum/subarray-sum-equals-k" }, + { from: "/567", to: "/sliding-window/permutation-in-string" }, + { 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: "/977", to: "/two-pointers/squares-of-a-sorted-array" }, + { from: "/994", to: "/graph-bfs/rotting-oranges" }, + { from: "/1448", to: "/tree-bfs/count-good-nodes-in-binary-tree" }, + { from: "/1832", to: "/hash-table/check-if-the-sentence-is-pangram" }, +];