docs(docs): remove /leetcode prefix from homepage tile URLs

apps/docs/content/index.mdx

@@ -15,7 +15,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Hash Table"
       description="A key maps to a value in constant time, which removes the need for a full scan."
-      href="/leetcode/hash-table"
+      href="/hash-table"
     >
       <Icon icon="hash" size={28} />
     </Tile>
@@ -24,7 +24,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Prefix Sum"
       description="A running total is stored at each index, so the sum of any range is one subtraction."
-      href="/leetcode/prefix-sum"
+      href="/prefix-sum"
     >
       <Icon icon="sigma" size={28} />
     </Tile>
@@ -33,7 +33,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Two Pointers"
       description="Two indices move through the data from different positions and meet at the answer."
-      href="/leetcode/two-pointers"
+      href="/two-pointers"
     >
       <Icon icon="arrow-left-right" size={28} />
     </Tile>
@@ -42,7 +42,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Sliding Window"
       description="A range with a start and an end moves across the data, and the contents are updated at each step."
-      href="/leetcode/sliding-window"
+      href="/sliding-window"
     >
       <Icon icon="app-window" size={28} />
     </Tile>
@@ -51,7 +51,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Binary Search"
       description="Half of a sorted range is removed at each step until the target is found."
-      href="/leetcode/binary-search"
+      href="/binary-search"
     >
       <Icon icon="search" size={28} />
     </Tile>
@@ -60,7 +60,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Stack"
       description="Items are added and removed from one end, so the last item added is the first item removed."
-      href="/leetcode/stack"
+      href="/stack"
     >
       <Icon icon="layers" size={28} />
     </Tile>
@@ -69,7 +69,7 @@ Data is read in one direction, from the first item to the last. The current posi
     <Tile
       title="Monotonic Stack"
       description="A stack keeps its items in sorted order, which finds the next larger or smaller item in one pass."
-      href="/leetcode/monotonic-stack"
+      href="/monotonic-stack"
     >
       <Icon icon="trending-up" size={28} />
     </Tile>
@@ -87,7 +87,7 @@ The data is in separate parts. Each part points to the next part, or sits next t
     <Tile
       title="Linked List"
       description="Each node points to the next node, and the pointers give the path through the data."
-      href="/leetcode/linked-list"
+      href="/linked-list"
     >
       <Icon icon="link" size={28} />
     </Tile>
@@ -96,7 +96,7 @@ The data is in separate parts. Each part points to the next part, or sits next t
     <Tile
       title="Hybrid Structures"
       description="Two structures are combined, such as a hash map and a linked list, to get the best properties of each."
-      href="/leetcode/hybrid-structures"
+      href="/hybrid-structures"
     >
       <Icon icon="combine" size={28} />
     </Tile>
@@ -105,7 +105,7 @@ The data is in separate parts. Each part points to the next part, or sits next t
     <Tile
       title="Matrix Index Math"
       description="A two-dimensional grid is read as a flat array through a formula, and the neighbors are found by arithmetic."
-      href="/leetcode/matrix-index-math"
+      href="/matrix-index-math"
     >
       <Icon icon="grid-3x3" size={28} />
     </Tile>
@@ -123,7 +123,7 @@ Each part points to one or more parts below it. Those parts do the same. The met
     <Tile
       title="Tree DFS"
       description="Each branch is followed to its end before the next branch is examined."
-      href="/leetcode/tree-dfs"
+      href="/tree-dfs"
     >
       <Icon icon="folder-tree" size={28} />
     </Tile>
@@ -132,7 +132,7 @@ Each part points to one or more parts below it. Those parts do the same. The met
     <Tile
       title="Tree BFS"
       description="All nodes at one level are visited before the nodes at the next level."
-      href="/leetcode/tree-bfs"
+      href="/tree-bfs"
     >
       <Icon icon="network" size={28} />
     </Tile>
@@ -141,7 +141,7 @@ Each part points to one or more parts below it. Those parts do the same. The met
     <Tile
       title="Binary Search Tree"
       description="Each node holds a value that is larger than its left subtree and smaller than its right subtree."
-      href="/leetcode/binary-search-tree"
+      href="/binary-search-tree"
     >
       <Icon icon="git-fork" size={28} />
     </Tile>
@@ -150,7 +150,7 @@ Each part points to one or more parts below it. Those parts do the same. The met
     <Tile
       title="Heap"
       description="The largest or smallest item is always at the top, and it is removed in logarithmic time."
-      href="/leetcode/heap-priority-queue"
+      href="/heap-priority-queue"
     >
       <Icon icon="triangle" size={28} />
     </Tile>
@@ -159,7 +159,7 @@ Each part points to one or more parts below it. Those parts do the same. The met
     <Tile
       title="Trie"
       description="Each node holds one character, and a path from the root spells a word."
-      href="/leetcode/trie"
+      href="/trie"
     >
       <Icon icon="spell-check" size={28} />
     </Tile>
@@ -177,7 +177,7 @@ Each part can point to any other part. Loops can occur. The method must visit ea
     <Tile
       title="Graph DFS"
       description="Each edge is followed to its end, and a visited set prevents a repeat visit."
-      href="/leetcode/graph-dfs"
+      href="/graph-dfs"
     >
       <Icon icon="waypoints" size={28} />
     </Tile>
@@ -186,7 +186,7 @@ Each part can point to any other part. Loops can occur. The method must visit ea
     <Tile
       title="Graph BFS"
       description="Nodes are visited in order of distance from the start, which gives the shortest path in an unweighted graph."
-      href="/leetcode/graph-bfs"
+      href="/graph-bfs"
     >
       <Icon icon="radar" size={28} />
     </Tile>
@@ -195,7 +195,7 @@ Each part can point to any other part. Loops can occur. The method must visit ea
     <Tile
       title="Topological Sort"
       description="Nodes are put in an order where each node comes after all nodes that point to it."
-      href="/leetcode/topological-sort"
+      href="/topological-sort"
     >
       <Icon icon="workflow" size={28} />
     </Tile>
@@ -204,7 +204,7 @@ Each part can point to any other part. Loops can occur. The method must visit ea
     <Tile
       title="Union-Find"
       description="Two sets are merged and the set of any item is found in near-constant time."
-      href="/leetcode/union-find"
+      href="/union-find"
     >
       <Icon icon="merge" size={28} />
     </Tile>
@@ -222,7 +222,7 @@ The data has no structure. The method makes one. Each choice makes a new branch.
     <Tile
       title="Backtracking"
       description="Each choice makes a branch, and a branch is undone when it does not give a valid result."
-      href="/leetcode/backtracking"
+      href="/backtracking"
     >
       <Icon icon="undo-2" size={28} />
     </Tile>
@@ -231,7 +231,7 @@ The data has no structure. The method makes one. Each choice makes a new branch.
     <Tile
       title="1-D DP"
       description="The result for each state is stored in a list, and each new result is computed from the results before it."
-      href="/leetcode/1d-dynamic-programming"
+      href="/1d-dynamic-programming"
     >
       <Icon icon="columns-3" size={28} />
     </Tile>
@@ -240,7 +240,7 @@ The data has no structure. The method makes one. Each choice makes a new branch.
     <Tile
       title="Multi-D / Grid DP"
       description="The result for each state is stored in a table with two or more dimensions, and each cell is computed from its neighbors."
-      href="/leetcode/multi-d-grid-dp"
+      href="/multi-d-grid-dp"
     >
       <Icon icon="table" size={28} />
     </Tile>
@@ -249,7 +249,7 @@ The data has no structure. The method makes one. Each choice makes a new branch.
     <Tile
       title="Greedy"
       description="The best local choice is made at each step and is not changed later."
-      href="/leetcode/greedy"
+      href="/greedy"
     >
       <Icon icon="coins" size={28} />
     </Tile>
@@ -258,7 +258,7 @@ The data has no structure. The method makes one. Each choice makes a new branch.
     <Tile
       title="Intervals"
       description="Ranges with a start and an end are sorted, and then merged, counted, or scheduled."
-      href="/leetcode/intervals"
+      href="/intervals"
     >
       <Icon icon="calendar-range" size={28} />
     </Tile>