From 88d1767184b7bc1b7526f2eb315ee59659b4fef5 Mon Sep 17 00:00:00 2001
From: Prad Nukala <prad@sonr.io>
Date: Fri, 25 Sep 2026 13:17:35 -0400
Subject: [PATCH] =?UTF-8?q?docs:=20replace=20legacy=20line=E2=80=91dot?=
 =?UTF-8?q?=E2=80=91left=E2=80=91horizontal=20icons=20with=20unified=20dot?=
 =?UTF-8?q?=20icon=20across=20docs?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../binary-search/153-find-minimum-in-rotated-sorted-array.mdx  | 2 +-
 .../binary-search/33-search-in-rotated-sorted-array.mdx         | 2 +-
 .../binary-search/35-search-insert-position.mdx                 | 2 +-
 .../(01-linear-structures)/binary-search/704-binary-search.mdx  | 2 +-
 .../binary-search/74-search-a-2d-matrix.mdx                     | 2 +-
 .../binary-search/875-koko-eating-bananas.mdx                   | 2 +-
 .../content/(01-linear-structures)/hash-table/1-two-sum.mdx     | 2 +-
 .../hash-table/1832-check-if-the-sentence-is-pangram.mdx        | 2 +-
 .../hash-table/217-contains-duplicate.mdx                       | 2 +-
 .../(01-linear-structures)/hash-table/242-valid-anagram.mdx     | 2 +-
 .../hash-table/347-top-k-frequent-elements.mdx                  | 2 +-
 .../hash-table/387-first-unique-character-in-a-string.mdx       | 2 +-
 .../hash-table/451-sort-characters-by-frequency.mdx             | 2 +-
 .../(01-linear-structures)/hash-table/49-group-anagrams.mdx     | 2 +-
 .../monotonic-stack/739-daily-temperatures.mdx                  | 2 +-
 .../(01-linear-structures)/monotonic-stack/853-car-fleet.mdx    | 2 +-
 .../prefix-sum/238-product-of-array-except-self.mdx             | 2 +-
 .../prefix-sum/303-range-sum-query-immutable.mdx                | 2 +-
 .../prefix-sum/560-subarray-sum-equals-k.mdx                    | 2 +-
 .../sliding-window/121-best-time-to-buy-and-sell-stock.mdx      | 2 +-
 .../3-longest-substring-without-repeating-characters.mdx        | 2 +-
 .../424-longest-repeating-character-replacement.mdx             | 2 +-
 .../sliding-window/567-permutation-in-string.mdx                | 2 +-
 .../stack/150-evaluate-reverse-polish-notation.mdx              | 2 +-
 .../docs/content/(01-linear-structures)/stack/155-min-stack.mdx | 2 +-
 .../(01-linear-structures)/stack/20-valid-parentheses.mdx       | 2 +-
 .../two-pointers/11-container-with-most-water.mdx               | 2 +-
 .../two-pointers/125-valid-palindrome.mdx                       | 2 +-
 .../content/(01-linear-structures)/two-pointers/15-3sum.mdx     | 2 +-
 .../two-pointers/167-two-sum-ii-input-array-is-sorted.mdx       | 2 +-
 .../(01-linear-structures)/two-pointers/344-reverse-string.mdx  | 2 +-
 .../(01-linear-structures)/two-pointers/392-is-subsequence.mdx  | 2 +-
 .../two-pointers/977-squares-of-a-sorted-array.mdx              | 2 +-
 .../content/(02-nodal-grid)/hybrid-structures/146-lru-cache.mdx | 2 +-
 .../(02-nodal-grid)/hybrid-structures/2-add-two-numbers.mdx     | 2 +-
 .../(02-nodal-grid)/linked-list/141-linked-list-cycle.mdx       | 2 +-
 .../(02-nodal-grid)/linked-list/206-reverse-linked-list.mdx     | 2 +-
 .../(02-nodal-grid)/linked-list/21-merge-two-sorted-lists.mdx   | 2 +-
 .../(02-nodal-grid)/matrix-index-math/48-rotate-image.mdx       | 2 +-
 .../(02-nodal-grid)/matrix-index-math/54-spiral-matrix.mdx      | 2 +-
 .../(02-nodal-grid)/matrix-index-math/73-set-matrix-zeroes.mdx  | 2 +-
 .../binary-search-tree/230-kth-smallest-element-in-a-bst.mdx    | 2 +-
 .../235-lowest-common-ancestor-of-a-binary-search-tree.mdx      | 2 +-
 .../binary-search-tree/98-validate-binary-search-tree.mdx       | 2 +-
 .../heap-priority-queue/215-kth-largest-element-in-an-array.mdx | 2 +-
 .../heap-priority-queue/23-merge-k-sorted-lists.mdx             | 2 +-
 .../heap-priority-queue/973-k-closest-points-to-origin.mdx      | 2 +-
 .../tree-bfs/102-binary-tree-level-order-traversal.mdx          | 2 +-
 .../tree-bfs/1448-count-good-nodes-in-binary-tree.mdx           | 2 +-
 .../tree-bfs/199-binary-tree-right-side-view.mdx                | 2 +-
 .../tree-dfs/104-maximum-depth-of-binary-tree.mdx               | 2 +-
 .../(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx       | 2 +-
 .../tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx    | 2 +-
 .../(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx   | 2 +-
 .../trie/211-design-add-and-search-words-data-structure.mdx     | 2 +-
 apps/docs/content/(04-relational)/graph-bfs/127-word-ladder.mdx | 2 +-
 .../content/(04-relational)/graph-bfs/994-rotting-oranges.mdx   | 2 +-
 apps/docs/content/(04-relational)/graph-dfs/133-clone-graph.mdx | 2 +-
 .../content/(04-relational)/graph-dfs/200-number-of-islands.mdx | 2 +-
 .../graph-dfs/417-pacific-atlantic-water-flow.mdx               | 2 +-
 .../(04-relational)/topological-sort/207-course-schedule.mdx    | 2 +-
 .../(04-relational)/topological-sort/210-course-schedule-ii.mdx | 2 +-
 ...23-number-of-connected-components-in-an-undirected-graph.mdx | 2 +-
 .../(04-relational)/union-find/684-redundant-connection.mdx     | 2 +-
 .../(05-decision-space)/backtracking/39-combination-sum.mdx     | 2 +-
 .../(05-decision-space)/backtracking/46-permutations.mdx        | 2 +-
 .../content/(05-decision-space)/backtracking/78-subsets.mdx     | 2 +-
 67 files changed, 67 insertions(+), 67 deletions(-)

diff --git a/apps/docs/content/(01-linear-structures)/binary-search/153-find-minimum-in-rotated-sorted-array.mdx b/apps/docs/content/(01-linear-structures)/binary-search/153-find-minimum-in-rotated-sorted-array.mdx
index 3df555e..a36b83b 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/153-find-minimum-in-rotated-sorted-array.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/153-find-minimum-in-rotated-sorted-array.mdx
@@ -1,7 +1,7 @@
 ---
 title: '153. Find Minimum in Rotated Sorted Array'
 description: 'Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:'
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Find Minimum in Rotated Sorted Array'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/binary-search/33-search-in-rotated-sorted-array.mdx b/apps/docs/content/(01-linear-structures)/binary-search/33-search-in-rotated-sorted-array.mdx
index 4ccb15f..1080e03 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/33-search-in-rotated-sorted-array.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/33-search-in-rotated-sorted-array.mdx
@@ -1,7 +1,7 @@
 ---
 title: '33. Search in Rotated Sorted Array'
 description: There is an integer array nums sorted in ascending order (with distinct values)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Search in Rotated Sorted Array'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/binary-search/35-search-insert-position.mdx b/apps/docs/content/(01-linear-structures)/binary-search/35-search-insert-position.mdx
index 5666f3d..16a287d 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/35-search-insert-position.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/35-search-insert-position.mdx
@@ -1,7 +1,7 @@
 ---
 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: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Search Insert Position'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/binary-search/704-binary-search.mdx b/apps/docs/content/(01-linear-structures)/binary-search/704-binary-search.mdx
index bd97661..45fba2b 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/704-binary-search.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/704-binary-search.mdx
@@ -1,7 +1,7 @@
 ---
 title: '704. Binary Search'
 description: Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Binary Search'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/binary-search/74-search-a-2d-matrix.mdx b/apps/docs/content/(01-linear-structures)/binary-search/74-search-a-2d-matrix.mdx
index 735d2e8..e39167b 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/74-search-a-2d-matrix.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/74-search-a-2d-matrix.mdx
@@ -1,7 +1,7 @@
 ---
 title: '74. Search a 2D Matrix'
 description: 'You are given an m x n integer matrix matrix with the following two properties:'
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Search a 2D Matrix'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/binary-search/875-koko-eating-bananas.mdx b/apps/docs/content/(01-linear-structures)/binary-search/875-koko-eating-bananas.mdx
index cc1b35f..d5f6a25 100644
--- a/apps/docs/content/(01-linear-structures)/binary-search/875-koko-eating-bananas.mdx
+++ b/apps/docs/content/(01-linear-structures)/binary-search/875-koko-eating-bananas.mdx
@@ -1,7 +1,7 @@
 ---
 title: '875. Koko Eating Bananas'
 description: Koko loves to eat bananas. There are n piles of bananas, the i^th pile has piles[i] bananas. The guards have gone and will come back in h hours
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Koko Eating Bananas'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/1-two-sum.mdx b/apps/docs/content/(01-linear-structures)/hash-table/1-two-sum.mdx
index bb45cda..b9f34d5 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/1-two-sum.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/1-two-sum.mdx
@@ -1,7 +1,7 @@
 ---
 title: '1. Two Sum'
 description: You are given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Two Sum'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/1832-check-if-the-sentence-is-pangram.mdx b/apps/docs/content/(01-linear-structures)/hash-table/1832-check-if-the-sentence-is-pangram.mdx
index 4b9da8d..1a64fe9 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/1832-check-if-the-sentence-is-pangram.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/1832-check-if-the-sentence-is-pangram.mdx
@@ -1,7 +1,7 @@
 ---
 title: '1832. Check if the Sentence Is Pangram'
 description: A pangram is a sentence where every letter of the English alphabet appears at least once
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Check if the Sentence Is Pangram'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/217-contains-duplicate.mdx b/apps/docs/content/(01-linear-structures)/hash-table/217-contains-duplicate.mdx
index 82bc4df..0d50140 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/217-contains-duplicate.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/217-contains-duplicate.mdx
@@ -1,7 +1,7 @@
 ---
 title: '217. Contains Duplicate'
 description: Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Contains Duplicate'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/242-valid-anagram.mdx b/apps/docs/content/(01-linear-structures)/hash-table/242-valid-anagram.mdx
index 22b8f49..09f276d 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/242-valid-anagram.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/242-valid-anagram.mdx
@@ -1,7 +1,7 @@
 ---
 title: '242. Valid Anagram'
 description: Given two strings s and t, return true if t is an anagram of s, and false otherwise
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Valid Anagram'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/347-top-k-frequent-elements.mdx b/apps/docs/content/(01-linear-structures)/hash-table/347-top-k-frequent-elements.mdx
index 1fac991..1607c16 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/347-top-k-frequent-elements.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/347-top-k-frequent-elements.mdx
@@ -1,7 +1,7 @@
 ---
 title: '347. Top K Frequent Elements'
 description: Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Top K Frequent Elements'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/387-first-unique-character-in-a-string.mdx b/apps/docs/content/(01-linear-structures)/hash-table/387-first-unique-character-in-a-string.mdx
index ab49b2f..db51319 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/387-first-unique-character-in-a-string.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/387-first-unique-character-in-a-string.mdx
@@ -1,7 +1,7 @@
 ---
 title: '387. First Unique Character in a String'
 description: Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'First Unique Character in a String'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/451-sort-characters-by-frequency.mdx b/apps/docs/content/(01-linear-structures)/hash-table/451-sort-characters-by-frequency.mdx
index 628b4f0..53310ea 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/451-sort-characters-by-frequency.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/451-sort-characters-by-frequency.mdx
@@ -1,7 +1,7 @@
 ---
 title: '451. Sort Characters By Frequency'
 description: Given a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Sort Characters By Frequency'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/hash-table/49-group-anagrams.mdx b/apps/docs/content/(01-linear-structures)/hash-table/49-group-anagrams.mdx
index c35ac43..378c7a9 100644
--- a/apps/docs/content/(01-linear-structures)/hash-table/49-group-anagrams.mdx
+++ b/apps/docs/content/(01-linear-structures)/hash-table/49-group-anagrams.mdx
@@ -1,7 +1,7 @@
 ---
 title: '49. Group Anagrams'
 description: Given an array of strings strs, group the anagrams together. You can return the answer in any order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Group Anagrams'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/monotonic-stack/739-daily-temperatures.mdx b/apps/docs/content/(01-linear-structures)/monotonic-stack/739-daily-temperatures.mdx
index e3795ea..7b7dea6 100644
--- a/apps/docs/content/(01-linear-structures)/monotonic-stack/739-daily-temperatures.mdx
+++ b/apps/docs/content/(01-linear-structures)/monotonic-stack/739-daily-temperatures.mdx
@@ -1,7 +1,7 @@
 ---
 title: '739. Daily Temperatures'
 description: Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the i^th day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Daily Temperatures'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/monotonic-stack/853-car-fleet.mdx b/apps/docs/content/(01-linear-structures)/monotonic-stack/853-car-fleet.mdx
index 012129c..4ba58eb 100644
--- a/apps/docs/content/(01-linear-structures)/monotonic-stack/853-car-fleet.mdx
+++ b/apps/docs/content/(01-linear-structures)/monotonic-stack/853-car-fleet.mdx
@@ -1,7 +1,7 @@
 ---
 title: '853. Car Fleet'
 description: There are n cars at given miles away from the starting mile 0, traveling to reach the mile target
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Car Fleet'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/prefix-sum/238-product-of-array-except-self.mdx b/apps/docs/content/(01-linear-structures)/prefix-sum/238-product-of-array-except-self.mdx
index 1af03a3..49992ad 100644
--- a/apps/docs/content/(01-linear-structures)/prefix-sum/238-product-of-array-except-self.mdx
+++ b/apps/docs/content/(01-linear-structures)/prefix-sum/238-product-of-array-except-self.mdx
@@ -1,7 +1,7 @@
 ---
 title: '238. Product of Array Except Self'
 description: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Product of Array Except Self'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/prefix-sum/303-range-sum-query-immutable.mdx b/apps/docs/content/(01-linear-structures)/prefix-sum/303-range-sum-query-immutable.mdx
index 9f6bc51..7ed5964 100644
--- a/apps/docs/content/(01-linear-structures)/prefix-sum/303-range-sum-query-immutable.mdx
+++ b/apps/docs/content/(01-linear-structures)/prefix-sum/303-range-sum-query-immutable.mdx
@@ -1,7 +1,7 @@
 ---
 title: '303. Range Sum Query - Immutable'
 description: Given an integer array nums, handle multiple queries of the following type
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Range Sum Query - Immutable'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/prefix-sum/560-subarray-sum-equals-k.mdx b/apps/docs/content/(01-linear-structures)/prefix-sum/560-subarray-sum-equals-k.mdx
index c52756d..0ac11e3 100644
--- a/apps/docs/content/(01-linear-structures)/prefix-sum/560-subarray-sum-equals-k.mdx
+++ b/apps/docs/content/(01-linear-structures)/prefix-sum/560-subarray-sum-equals-k.mdx
@@ -1,7 +1,7 @@
 ---
 title: '560. Subarray Sum Equals K'
 description: Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Subarray Sum Equals K'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/sliding-window/121-best-time-to-buy-and-sell-stock.mdx b/apps/docs/content/(01-linear-structures)/sliding-window/121-best-time-to-buy-and-sell-stock.mdx
index 4b5775a..ba13348 100644
--- a/apps/docs/content/(01-linear-structures)/sliding-window/121-best-time-to-buy-and-sell-stock.mdx
+++ b/apps/docs/content/(01-linear-structures)/sliding-window/121-best-time-to-buy-and-sell-stock.mdx
@@ -1,7 +1,7 @@
 ---
 title: '121. Best Time to Buy and Sell Stock'
 description: You are given an array prices where prices[i] is the price of a given stock on the i^th day
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Best Time to Buy and Sell Stock'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/sliding-window/3-longest-substring-without-repeating-characters.mdx b/apps/docs/content/(01-linear-structures)/sliding-window/3-longest-substring-without-repeating-characters.mdx
index cb234bd..3ba366b 100644
--- a/apps/docs/content/(01-linear-structures)/sliding-window/3-longest-substring-without-repeating-characters.mdx
+++ b/apps/docs/content/(01-linear-structures)/sliding-window/3-longest-substring-without-repeating-characters.mdx
@@ -1,7 +1,7 @@
 ---
 title: '3. Longest Substring Without Repeating Characters'
 description: Given a string s, find the length of the longest substring without duplicate characters
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Longest Substring Without Repeating Characters'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/sliding-window/424-longest-repeating-character-replacement.mdx b/apps/docs/content/(01-linear-structures)/sliding-window/424-longest-repeating-character-replacement.mdx
index ddaa922..c1b2d87 100644
--- a/apps/docs/content/(01-linear-structures)/sliding-window/424-longest-repeating-character-replacement.mdx
+++ b/apps/docs/content/(01-linear-structures)/sliding-window/424-longest-repeating-character-replacement.mdx
@@ -1,7 +1,7 @@
 ---
 title: '424. Longest Repeating Character Replacement'
 description: You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform this operation at most k times
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Longest Repeating Character Replacement'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/sliding-window/567-permutation-in-string.mdx b/apps/docs/content/(01-linear-structures)/sliding-window/567-permutation-in-string.mdx
index faf1b03..b4b50a3 100644
--- a/apps/docs/content/(01-linear-structures)/sliding-window/567-permutation-in-string.mdx
+++ b/apps/docs/content/(01-linear-structures)/sliding-window/567-permutation-in-string.mdx
@@ -1,7 +1,7 @@
 ---
 title: '567. Permutation in String'
 description: Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Permutation in String'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/stack/150-evaluate-reverse-polish-notation.mdx b/apps/docs/content/(01-linear-structures)/stack/150-evaluate-reverse-polish-notation.mdx
index 578534d..53cb814 100644
--- a/apps/docs/content/(01-linear-structures)/stack/150-evaluate-reverse-polish-notation.mdx
+++ b/apps/docs/content/(01-linear-structures)/stack/150-evaluate-reverse-polish-notation.mdx
@@ -1,7 +1,7 @@
 ---
 title: '150. Evaluate Reverse Polish Notation'
 description: You are given an array of strings tokens that represents an arithmetic expression in a Reverse Polish Notation
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Evaluate Reverse Polish Notation'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/stack/155-min-stack.mdx b/apps/docs/content/(01-linear-structures)/stack/155-min-stack.mdx
index 9d7800b..ab2d7b5 100644
--- a/apps/docs/content/(01-linear-structures)/stack/155-min-stack.mdx
+++ b/apps/docs/content/(01-linear-structures)/stack/155-min-stack.mdx
@@ -1,7 +1,7 @@
 ---
 title: '155. Min Stack'
 description: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Min Stack'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/stack/20-valid-parentheses.mdx b/apps/docs/content/(01-linear-structures)/stack/20-valid-parentheses.mdx
index 0ee8835..ffca734 100644
--- a/apps/docs/content/(01-linear-structures)/stack/20-valid-parentheses.mdx
+++ b/apps/docs/content/(01-linear-structures)/stack/20-valid-parentheses.mdx
@@ -1,7 +1,7 @@
 ---
 title: '20. Valid Parentheses'
 description: Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Valid Parentheses'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/11-container-with-most-water.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/11-container-with-most-water.mdx
index c65a51d..0773e63 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/11-container-with-most-water.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/11-container-with-most-water.mdx
@@ -1,7 +1,7 @@
 ---
 title: '11. Container With Most Water'
 description: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the i^th line are (i, 0) and (i, height[i])
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Container With Most Water'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/125-valid-palindrome.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/125-valid-palindrome.mdx
index a0df08e..6ac36be 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/125-valid-palindrome.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/125-valid-palindrome.mdx
@@ -1,7 +1,7 @@
 ---
 title: '125. Valid Palindrome'
 description: A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Valid Palindrome'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/15-3sum.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/15-3sum.mdx
index e2e718a..8b4faf3 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/15-3sum.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/15-3sum.mdx
@@ -1,7 +1,7 @@
 ---
 title: '15. 3Sum'
 description: Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: '3Sum'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/167-two-sum-ii-input-array-is-sorted.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/167-two-sum-ii-input-array-is-sorted.mdx
index 95b84a5..4ccf28b 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/167-two-sum-ii-input-array-is-sorted.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/167-two-sum-ii-input-array-is-sorted.mdx
@@ -1,7 +1,7 @@
 ---
 title: '167. Two Sum II - Input Array Is Sorted'
 description: Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Two Sum II - Input Array Is Sorted'
   badge: 'Medium'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/344-reverse-string.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/344-reverse-string.mdx
index dd70934..bef6c24 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/344-reverse-string.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/344-reverse-string.mdx
@@ -1,7 +1,7 @@
 ---
 title: '344. Reverse String'
 description: Write a function that reverses a string. The input string is given as an array of characters s
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Reverse String'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/392-is-subsequence.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/392-is-subsequence.mdx
index f4f19ae..222cd17 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/392-is-subsequence.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/392-is-subsequence.mdx
@@ -1,7 +1,7 @@
 ---
 title: '392. Is Subsequence'
 description: Given two strings s and t, return true if s is a subsequence of t, or false otherwise
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Is Subsequence'
   badge: 'Easy'
diff --git a/apps/docs/content/(01-linear-structures)/two-pointers/977-squares-of-a-sorted-array.mdx b/apps/docs/content/(01-linear-structures)/two-pointers/977-squares-of-a-sorted-array.mdx
index daefb44..144a6c6 100644
--- a/apps/docs/content/(01-linear-structures)/two-pointers/977-squares-of-a-sorted-array.mdx
+++ b/apps/docs/content/(01-linear-structures)/two-pointers/977-squares-of-a-sorted-array.mdx
@@ -1,7 +1,7 @@
 ---
 title: '977. Squares of a Sorted Array'
 description: Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Squares of a Sorted Array'
   badge: 'Easy'
diff --git a/apps/docs/content/(02-nodal-grid)/hybrid-structures/146-lru-cache.mdx b/apps/docs/content/(02-nodal-grid)/hybrid-structures/146-lru-cache.mdx
index 943a427..bed410c 100644
--- a/apps/docs/content/(02-nodal-grid)/hybrid-structures/146-lru-cache.mdx
+++ b/apps/docs/content/(02-nodal-grid)/hybrid-structures/146-lru-cache.mdx
@@ -1,7 +1,7 @@
 ---
 title: '146. LRU Cache'
 description: Design a data structure that follows the constraints of a Least Recently Used (LRU) cache
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'LRU Cache'
   badge: 'Medium'
diff --git a/apps/docs/content/(02-nodal-grid)/hybrid-structures/2-add-two-numbers.mdx b/apps/docs/content/(02-nodal-grid)/hybrid-structures/2-add-two-numbers.mdx
index 97dd528..935a9e6 100644
--- a/apps/docs/content/(02-nodal-grid)/hybrid-structures/2-add-two-numbers.mdx
+++ b/apps/docs/content/(02-nodal-grid)/hybrid-structures/2-add-two-numbers.mdx
@@ -1,7 +1,7 @@
 ---
 title: '2. Add Two Numbers'
 description: You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Add Two Numbers'
   badge: 'Medium'
diff --git a/apps/docs/content/(02-nodal-grid)/linked-list/141-linked-list-cycle.mdx b/apps/docs/content/(02-nodal-grid)/linked-list/141-linked-list-cycle.mdx
index 58105a3..7888f96 100644
--- a/apps/docs/content/(02-nodal-grid)/linked-list/141-linked-list-cycle.mdx
+++ b/apps/docs/content/(02-nodal-grid)/linked-list/141-linked-list-cycle.mdx
@@ -1,7 +1,7 @@
 ---
 title: '141. Linked List Cycle'
 description: Given head, the head of a linked list, determine if the linked list has a cycle in it
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Linked List Cycle'
   badge: 'Easy'
diff --git a/apps/docs/content/(02-nodal-grid)/linked-list/206-reverse-linked-list.mdx b/apps/docs/content/(02-nodal-grid)/linked-list/206-reverse-linked-list.mdx
index 1c2b342..cb90bb8 100644
--- a/apps/docs/content/(02-nodal-grid)/linked-list/206-reverse-linked-list.mdx
+++ b/apps/docs/content/(02-nodal-grid)/linked-list/206-reverse-linked-list.mdx
@@ -1,7 +1,7 @@
 ---
 title: '206. Reverse Linked List'
 description: Given the head of a singly linked list, reverse the list, and return the reversed list
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Reverse Linked List'
   badge: 'Easy'
diff --git a/apps/docs/content/(02-nodal-grid)/linked-list/21-merge-two-sorted-lists.mdx b/apps/docs/content/(02-nodal-grid)/linked-list/21-merge-two-sorted-lists.mdx
index 3d6768a..af967a6 100644
--- a/apps/docs/content/(02-nodal-grid)/linked-list/21-merge-two-sorted-lists.mdx
+++ b/apps/docs/content/(02-nodal-grid)/linked-list/21-merge-two-sorted-lists.mdx
@@ -1,7 +1,7 @@
 ---
 title: '21. Merge Two Sorted Lists'
 description: You are given the heads of two sorted linked lists list1 and list2
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Merge Two Sorted Lists'
   badge: 'Easy'
diff --git a/apps/docs/content/(02-nodal-grid)/matrix-index-math/48-rotate-image.mdx b/apps/docs/content/(02-nodal-grid)/matrix-index-math/48-rotate-image.mdx
index 3ae2f66..e5e8754 100644
--- a/apps/docs/content/(02-nodal-grid)/matrix-index-math/48-rotate-image.mdx
+++ b/apps/docs/content/(02-nodal-grid)/matrix-index-math/48-rotate-image.mdx
@@ -1,7 +1,7 @@
 ---
 title: '48. Rotate Image'
 description: You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Rotate Image'
   badge: 'Medium'
diff --git a/apps/docs/content/(02-nodal-grid)/matrix-index-math/54-spiral-matrix.mdx b/apps/docs/content/(02-nodal-grid)/matrix-index-math/54-spiral-matrix.mdx
index f7079ad..b402466 100644
--- a/apps/docs/content/(02-nodal-grid)/matrix-index-math/54-spiral-matrix.mdx
+++ b/apps/docs/content/(02-nodal-grid)/matrix-index-math/54-spiral-matrix.mdx
@@ -1,7 +1,7 @@
 ---
 title: '54. Spiral Matrix'
 description: Given an m x n matrix, return all elements of the matrix in spiral order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Spiral Matrix'
   badge: 'Medium'
diff --git a/apps/docs/content/(02-nodal-grid)/matrix-index-math/73-set-matrix-zeroes.mdx b/apps/docs/content/(02-nodal-grid)/matrix-index-math/73-set-matrix-zeroes.mdx
index 5750592..5508041 100644
--- a/apps/docs/content/(02-nodal-grid)/matrix-index-math/73-set-matrix-zeroes.mdx
+++ b/apps/docs/content/(02-nodal-grid)/matrix-index-math/73-set-matrix-zeroes.mdx
@@ -1,7 +1,7 @@
 ---
 title: '73. Set Matrix Zeroes'
 description: Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Set Matrix Zeroes'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/binary-search-tree/230-kth-smallest-element-in-a-bst.mdx b/apps/docs/content/(03-hierarchical)/binary-search-tree/230-kth-smallest-element-in-a-bst.mdx
index 2b465d4..ddd555e 100644
--- a/apps/docs/content/(03-hierarchical)/binary-search-tree/230-kth-smallest-element-in-a-bst.mdx
+++ b/apps/docs/content/(03-hierarchical)/binary-search-tree/230-kth-smallest-element-in-a-bst.mdx
@@ -1,7 +1,7 @@
 ---
 title: '230. Kth Smallest Element in a BST'
 description: Given the root of a binary search tree, and an integer k, return the k^th smallest value (1-indexed) of all the values of the nodes in the tree
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Kth Smallest Element in a BST'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.mdx b/apps/docs/content/(03-hierarchical)/binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.mdx
index e9e8e89..456f6db 100644
--- a/apps/docs/content/(03-hierarchical)/binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '235. Lowest Common Ancestor of a Binary Search Tree'
 description: Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Lowest Common Ancestor of a Binary Search Tree'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/binary-search-tree/98-validate-binary-search-tree.mdx b/apps/docs/content/(03-hierarchical)/binary-search-tree/98-validate-binary-search-tree.mdx
index b0469b4..2961c25 100644
--- a/apps/docs/content/(03-hierarchical)/binary-search-tree/98-validate-binary-search-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/binary-search-tree/98-validate-binary-search-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '98. Validate Binary Search Tree'
 description: Given the root of a binary tree, determine if it is a valid binary search tree (BST)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Validate Binary Search Tree'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/heap-priority-queue/215-kth-largest-element-in-an-array.mdx b/apps/docs/content/(03-hierarchical)/heap-priority-queue/215-kth-largest-element-in-an-array.mdx
index 4309c4a..766365d 100644
--- a/apps/docs/content/(03-hierarchical)/heap-priority-queue/215-kth-largest-element-in-an-array.mdx
+++ b/apps/docs/content/(03-hierarchical)/heap-priority-queue/215-kth-largest-element-in-an-array.mdx
@@ -1,7 +1,7 @@
 ---
 title: '215. Kth Largest Element in an Array'
 description: Given an integer array nums and an integer k, return the k^th largest element in the array
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Kth Largest Element in an Array'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/heap-priority-queue/23-merge-k-sorted-lists.mdx b/apps/docs/content/(03-hierarchical)/heap-priority-queue/23-merge-k-sorted-lists.mdx
index 055790b..5bea9f6 100644
--- a/apps/docs/content/(03-hierarchical)/heap-priority-queue/23-merge-k-sorted-lists.mdx
+++ b/apps/docs/content/(03-hierarchical)/heap-priority-queue/23-merge-k-sorted-lists.mdx
@@ -1,7 +1,7 @@
 ---
 title: '23. Merge k Sorted Lists'
 description: You are given an array of k linked-lists lists, each linked-list is sorted in ascending order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Merge k Sorted Lists'
   badge: 'Hard'
diff --git a/apps/docs/content/(03-hierarchical)/heap-priority-queue/973-k-closest-points-to-origin.mdx b/apps/docs/content/(03-hierarchical)/heap-priority-queue/973-k-closest-points-to-origin.mdx
index 0940eb2..87b1796 100644
--- a/apps/docs/content/(03-hierarchical)/heap-priority-queue/973-k-closest-points-to-origin.mdx
+++ b/apps/docs/content/(03-hierarchical)/heap-priority-queue/973-k-closest-points-to-origin.mdx
@@ -1,7 +1,7 @@
 ---
 title: '973. K Closest Points to Origin'
 description: Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'K Closest Points to Origin'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/tree-bfs/102-binary-tree-level-order-traversal.mdx b/apps/docs/content/(03-hierarchical)/tree-bfs/102-binary-tree-level-order-traversal.mdx
index 2368a7e..e1b0abc 100644
--- a/apps/docs/content/(03-hierarchical)/tree-bfs/102-binary-tree-level-order-traversal.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-bfs/102-binary-tree-level-order-traversal.mdx
@@ -1,7 +1,7 @@
 ---
 title: '102. Binary Tree Level Order Traversal'
 description: Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Binary Tree Level Order Traversal'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/tree-bfs/1448-count-good-nodes-in-binary-tree.mdx b/apps/docs/content/(03-hierarchical)/tree-bfs/1448-count-good-nodes-in-binary-tree.mdx
index b80ed9b..3386bdd 100644
--- a/apps/docs/content/(03-hierarchical)/tree-bfs/1448-count-good-nodes-in-binary-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-bfs/1448-count-good-nodes-in-binary-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '1448. Count Good Nodes in Binary Tree'
 description: Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Count Good Nodes in Binary Tree'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/tree-bfs/199-binary-tree-right-side-view.mdx b/apps/docs/content/(03-hierarchical)/tree-bfs/199-binary-tree-right-side-view.mdx
index 9376f2c..2640241 100644
--- a/apps/docs/content/(03-hierarchical)/tree-bfs/199-binary-tree-right-side-view.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-bfs/199-binary-tree-right-side-view.mdx
@@ -1,7 +1,7 @@
 ---
 title: '199. Binary Tree Right Side View'
 description: Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Binary Tree Right Side View'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/tree-dfs/104-maximum-depth-of-binary-tree.mdx b/apps/docs/content/(03-hierarchical)/tree-dfs/104-maximum-depth-of-binary-tree.mdx
index e5b0552..ae9ccb6 100644
--- a/apps/docs/content/(03-hierarchical)/tree-dfs/104-maximum-depth-of-binary-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-dfs/104-maximum-depth-of-binary-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '104. Maximum Depth of Binary Tree'
 description: Given the root of a binary tree, return its maximum depth
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Maximum Depth of Binary Tree'
   badge: 'Easy'
diff --git a/apps/docs/content/(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx b/apps/docs/content/(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx
index c324ebd..c2853f1 100644
--- a/apps/docs/content/(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '226. Invert Binary Tree'
 description: Given the root of a binary tree, invert the tree, and return its root
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Invert Binary Tree'
   badge: 'Easy'
diff --git a/apps/docs/content/(03-hierarchical)/tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx b/apps/docs/content/(03-hierarchical)/tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx
index 0f56e42..13f0f72 100644
--- a/apps/docs/content/(03-hierarchical)/tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx
@@ -1,7 +1,7 @@
 ---
 title: '236. Lowest Common Ancestor of a Binary Tree'
 description: Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Lowest Common Ancestor of a Binary Tree'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx b/apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx
index e138727..3480dd5 100644
--- a/apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx
+++ b/apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx
@@ -1,7 +1,7 @@
 ---
 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: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Implement Trie (Prefix Tree)'
   badge: 'Medium'
diff --git a/apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx b/apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx
index a2e3c19..e3e3c62 100644
--- a/apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx
+++ b/apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx
@@ -1,7 +1,7 @@
 ---
 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: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Design Add and Search Words Data Structure'
   badge: 'Medium'
diff --git a/apps/docs/content/(04-relational)/graph-bfs/127-word-ladder.mdx b/apps/docs/content/(04-relational)/graph-bfs/127-word-ladder.mdx
index 0b84557..8f448eb 100644
--- a/apps/docs/content/(04-relational)/graph-bfs/127-word-ladder.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/graph-bfs/994-rotting-oranges.mdx b/apps/docs/content/(04-relational)/graph-bfs/994-rotting-oranges.mdx
index bafdc87..761a775 100644
--- a/apps/docs/content/(04-relational)/graph-bfs/994-rotting-oranges.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/graph-dfs/133-clone-graph.mdx b/apps/docs/content/(04-relational)/graph-dfs/133-clone-graph.mdx
index 7b952d3..308d1a0 100644
--- a/apps/docs/content/(04-relational)/graph-dfs/133-clone-graph.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/graph-dfs/200-number-of-islands.mdx b/apps/docs/content/(04-relational)/graph-dfs/200-number-of-islands.mdx
index 788d049..f82ce6a 100644
--- a/apps/docs/content/(04-relational)/graph-dfs/200-number-of-islands.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/graph-dfs/417-pacific-atlantic-water-flow.mdx b/apps/docs/content/(04-relational)/graph-dfs/417-pacific-atlantic-water-flow.mdx
index 55038f1..2ff5851 100644
--- a/apps/docs/content/(04-relational)/graph-dfs/417-pacific-atlantic-water-flow.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/topological-sort/207-course-schedule.mdx b/apps/docs/content/(04-relational)/topological-sort/207-course-schedule.mdx
index c29845b..805acc5 100644
--- a/apps/docs/content/(04-relational)/topological-sort/207-course-schedule.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/topological-sort/210-course-schedule-ii.mdx b/apps/docs/content/(04-relational)/topological-sort/210-course-schedule-ii.mdx
index 464c56b..c9fe4e8 100644
--- a/apps/docs/content/(04-relational)/topological-sort/210-course-schedule-ii.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/union-find/323-number-of-connected-components-in-an-undirected-graph.mdx b/apps/docs/content/(04-relational)/union-find/323-number-of-connected-components-in-an-undirected-graph.mdx
index a2eb51f..bd7675d 100644
--- a/apps/docs/content/(04-relational)/union-find/323-number-of-connected-components-in-an-undirected-graph.mdx
+++ b/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'
diff --git a/apps/docs/content/(04-relational)/union-find/684-redundant-connection.mdx b/apps/docs/content/(04-relational)/union-find/684-redundant-connection.mdx
index f63c1bf..1c0901c 100644
--- a/apps/docs/content/(04-relational)/union-find/684-redundant-connection.mdx
+++ b/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'
diff --git a/apps/docs/content/(05-decision-space)/backtracking/39-combination-sum.mdx b/apps/docs/content/(05-decision-space)/backtracking/39-combination-sum.mdx
index a67a4df..2610c8d 100644
--- a/apps/docs/content/(05-decision-space)/backtracking/39-combination-sum.mdx
+++ b/apps/docs/content/(05-decision-space)/backtracking/39-combination-sum.mdx
@@ -1,7 +1,7 @@
 ---
 title: '39. Combination Sum'
 description: Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Combination Sum'
   badge: 'Medium'
diff --git a/apps/docs/content/(05-decision-space)/backtracking/46-permutations.mdx b/apps/docs/content/(05-decision-space)/backtracking/46-permutations.mdx
index d538d76..e7fecd9 100644
--- a/apps/docs/content/(05-decision-space)/backtracking/46-permutations.mdx
+++ b/apps/docs/content/(05-decision-space)/backtracking/46-permutations.mdx
@@ -1,7 +1,7 @@
 ---
 title: '46. Permutations'
 description: Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Permutations'
   badge: 'Medium'
diff --git a/apps/docs/content/(05-decision-space)/backtracking/78-subsets.mdx b/apps/docs/content/(05-decision-space)/backtracking/78-subsets.mdx
index 3f4907c..0b01063 100644
--- a/apps/docs/content/(05-decision-space)/backtracking/78-subsets.mdx
+++ b/apps/docs/content/(05-decision-space)/backtracking/78-subsets.mdx
@@ -1,7 +1,7 @@
 ---
 title: '78. Subsets'
 description: Given an integer array nums of unique elements, return all possible subsets (the power set)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Subsets'
   badge: 'Medium'