docs(docs): add hidden index pages for algorithm topics and progress dashboard component

apps/docs/content/1d-dynamic-programming/index.mdx

@@ -0,0 +1,5 @@
+---
+title: 1-D Dynamic Programming
+description: 'The result for each state is stored in a list, and each new result is computed from the results before it.'
+hidden: true
+---

apps/docs/content/binary-search-tree/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Binary Search Tree
+description: 'Each node holds a value that is larger than its left subtree and smaller than its right subtree.'
+hidden: true
+---

apps/docs/content/binary-search/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Binary Search
+description: 'Half of a sorted range is removed at each step until the target is found.'
+hidden: true
+---

apps/docs/content/graph-bfs/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Graph BFS
+description: 'Nodes are visited in order of distance from the start, which gives the shortest path in an unweighted graph.'
+hidden: true
+---

apps/docs/content/graph-dfs/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Graph DFS
+description: 'Each edge is followed to its end, and a visited set prevents a repeat visit.'
+hidden: true
+---

apps/docs/content/greedy/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Greedy
+description: 'The best local choice is made at each step and is not changed later.'
+hidden: true
+---

apps/docs/content/hash-table/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Hash Table
+description: 'A key maps to a value in constant time, which removes the need for a full scan.'
+hidden: true
+---

apps/docs/content/heap-priority-queue/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Heap / Priority Queue
+description: 'The largest or smallest item is always at the top, and it is removed in logarithmic time.'
+hidden: true
+---

apps/docs/content/hybrid-structures/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Hybrid Structures
+description: 'Two structures are combined, such as a hash map and a linked list, to get the best properties of each.'
+hidden: true
+---

apps/docs/content/intervals/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Intervals
+description: 'Ranges with a start and an end are sorted, and then merged, counted, or scheduled.'
+hidden: true
+---

apps/docs/content/linked-list/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Linked List
+description: 'Each node points to the next node, and the pointers give the path through the data.'
+hidden: true
+---

apps/docs/content/matrix-index-math/index.mdx

@@ -0,0 +1,5 @@
+---
+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.'
+hidden: true
+---

apps/docs/content/monotonic-stack/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Monotonic Stack
+description: 'A stack keeps its items in sorted order, which finds the next larger or smaller item in one pass.'
+hidden: true
+---

apps/docs/content/multi-d-grid-dp/index.mdx

@@ -0,0 +1,5 @@
+---
+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.'
+hidden: true
+---

apps/docs/content/prefix-sum/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Prefix Sum
+description: 'A running total is stored at each index, so the sum of any range is one subtraction.'
+hidden: true
+---

apps/docs/content/progress.mdx

@@ -0,0 +1,7 @@
+---
+title: Progress
+description: Live SRS campaign dashboard — phases, ladder, review queue, gates, and recent attempts, fetched from the SRS Worker.
+icon: loader
+---
+
+<ProgressDashboard />

apps/docs/content/stack/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Stack
+description: 'Items are added and removed from one end, so the last item added is the first item removed.'
+hidden: true
+---

apps/docs/content/tree-bfs/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Tree BFS
+description: 'All nodes at one level are visited before the nodes at the next level.'
+hidden: true
+---

apps/docs/content/tree-dfs/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Tree DFS
+description: 'Each branch is followed to its end before the next branch is examined.'
+hidden: true
+---

apps/docs/content/trie/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Trie
+description: 'Each node holds one character, and a path from the root spells a word.'
+hidden: true
+---

apps/docs/content/two-pointers/index.mdx

@@ -0,0 +1,5 @@
+---
+title: Two Pointers
+description: 'Two indices move through the data from different positions and meet at the answer.'
+hidden: true
+---