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

apps/docs/content/(01-linear-structures)/binary-search/35-search-insert-position.mdx

@@ -2,13 +2,15 @@
 title: '35. Search Insert Position'
 description: Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order
 icon: dot
+topics:
+  - { name: "Array", slug: "array" }
+  - { name: "Binary Search", slug: "binary-search" }
+video: "K-RYzDZkzCI"
 sidebar:
   label: 'Search Insert Position'
   badge: 'Easy'
 ---
 
-<Badge variant="accent">Array</Badge>
-
 ::::warning
 You must write an algorithm with O(log n) runtime complexity.
 ::::
@@ -66,7 +68,3 @@ class Solution:
 
         return (l + r) // 2 + 1
 ```
-
-## Explanation
-
-<YouTube id="K-RYzDZkzCI" title="Search Insert Position - Binary Search - Leetcode 35 - Python" />