docs(docs): add ProblemBadges component, layout slot, and enrich pages with topics/video frontmatter, plus guide placeholders and topic‑landing map.

apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx

@@ -2,13 +2,17 @@
 title: '208. Implement Trie (Prefix Tree)'
 description: A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker
 icon: dot
+topics:
+  - { name: "Hash Table", slug: "hash-table" }
+  - { name: "String", slug: "string" }
+  - { name: "Design", slug: "design" }
+  - { name: "Trie", slug: "trie" }
+video: "oobqoCJlHA0"
 sidebar:
   label: 'Implement Trie (Prefix Tree)'
   badge: 'Medium'
 ---
 
-<Badge variant="accent">Hash Table</Badge>
-
 ### Example 1:
 - Input: ``
 - Output: ``
@@ -107,7 +111,3 @@ class Trie:
 # param_2 = obj.search(word)
 # param_3 = obj.startsWith(prefix)
 ```
-
-## Explanation
-
-<YouTube id="oobqoCJlHA0" title="Implement Trie (Prefix Tree) - Leetcode 208" />

apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx

@@ -2,13 +2,17 @@
 title: '211. Design Add and Search Words Data Structure'
 description: Design a data structure that supports adding new words and finding if a string matches any previously added string
 icon: dot
+topics:
+  - { name: "String", slug: "string" }
+  - { name: "Depth-First Search", slug: "depth-first-search" }
+  - { name: "Design", slug: "design" }
+  - { name: "Trie", slug: "trie" }
+video: "BTf05gs_8iU"
 sidebar:
   label: 'Design Add and Search Words Data Structure'
   badge: 'Medium'
 ---
 
-<Badge variant="accent">String</Badge>
-
 ### Constraints:
 
 - `1 <= word.length <= 25`
@@ -101,7 +105,3 @@ class WordDictionary:
 # obj.addWord(word)
 # param_3 = obj.search(word)
 ```
-
-## Explanation
-
-<YouTube id="BTf05gs_8iU" title="Design Add and Search Words Data Structure - Leetcode 211 - Python" />