docs(docs): add page icon frontmatter to problem pages

2026-11-02 21:22:43 +00:00 · 2026-09-25 13:14:25 -04:00
1 parent e189bb876e
commit 58ab9db1d7
@@ -1,6 +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
 sidebar:
  label: 'Find Minimum in Rotated Sorted Array'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Search in Rotated Sorted Array'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Search Insert Position'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Binary Search'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Search a 2D Matrix'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Koko Eating Bananas'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Two Sum'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Check if the Sentence Is Pangram'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Contains Duplicate'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Valid Anagram'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Top K Frequent Elements'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'First Unique Character in a String'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Sort Characters By Frequency'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Group Anagrams'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Daily Temperatures'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Car Fleet'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Product of Array Except Self'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Range Sum Query - Immutable'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Subarray Sum Equals K'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Best Time to Buy and Sell Stock'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Longest Substring Without Repeating Characters'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Longest Repeating Character Replacement'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Permutation in String'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Evaluate Reverse Polish Notation'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Min Stack'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Valid Parentheses'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Container With Most Water'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Valid Palindrome'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: '3Sum'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Two Sum II - Input Array Is Sorted'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Reverse String'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Is Subsequence'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Squares of a Sorted Array'
  badge: 'Easy'