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

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'

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'

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'

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'

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'

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'

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'