docs: replace legacy line‑dot‑left‑horizontal icons with unified dot icon across docs

apps/docs/content/(04-relational)/graph-bfs/127-word-ladder.mdx

@@ -1,7 +1,7 @@
 ---
 title: '127. Word Ladder'
 description: 'A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:'
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Word Ladder'
   badge: 'Hard'

apps/docs/content/(04-relational)/graph-bfs/994-rotting-oranges.mdx

@@ -1,7 +1,7 @@
 ---
 title: '994. Rotting Oranges'
 description: 'You are given an m x n grid where each cell can have one of three values:'
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Rotting Oranges'
   badge: 'Medium'

apps/docs/content/(04-relational)/graph-dfs/133-clone-graph.mdx

@@ -1,7 +1,7 @@
 ---
 title: '133. Clone Graph'
 description: Given a reference of a node in a connected undirected graph
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Clone Graph'
   badge: 'Medium'

apps/docs/content/(04-relational)/graph-dfs/200-number-of-islands.mdx

@@ -1,7 +1,7 @@
 ---
 title: '200. Number of Islands'
 description: Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Number of Islands'
   badge: 'Medium'

apps/docs/content/(04-relational)/graph-dfs/417-pacific-atlantic-water-flow.mdx

@@ -1,7 +1,7 @@
 ---
 title: '417. Pacific Atlantic Water Flow'
 description: There is an m x n rectangular island that borders both the Pacific Ocean and Atlantic Ocean. The Pacific Ocean touches the island's left and top edges, and the Atlantic Ocean touches the island's right and bottom edges
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Pacific Atlantic Water Flow'
   badge: 'Medium'

apps/docs/content/(04-relational)/topological-sort/207-course-schedule.mdx

@@ -1,7 +1,7 @@
 ---
 title: '207. Course Schedule'
 description: There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Course Schedule'
   badge: 'Medium'

apps/docs/content/(04-relational)/topological-sort/210-course-schedule-ii.mdx

@@ -1,7 +1,7 @@
 ---
 title: '210. Course Schedule II'
 description: There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Course Schedule II'
   badge: 'Medium'

apps/docs/content/(04-relational)/union-find/323-number-of-connected-components-in-an-undirected-graph.mdx

@@ -1,7 +1,7 @@
 ---
 title: '323. Number of Connected Components in an Undirected Graph'
 description: You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Number of Connected Components in an Undirected Graph'
   badge: 'Medium'

apps/docs/content/(04-relational)/union-find/684-redundant-connection.mdx

@@ -1,7 +1,7 @@
 ---
 title: '684. Redundant Connection'
 description: In this problem, a tree is an undirected graph that is connected and has no cycles
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Redundant Connection'
   badge: 'Medium'