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

2026-11-02 13:12:44 +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'
@@ -1,6 +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
 sidebar:
  label: 'LRU Cache'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Add Two Numbers'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Linked List Cycle'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Reverse Linked List'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Merge Two Sorted Lists'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Rotate Image'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Spiral Matrix'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Set Matrix Zeroes'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Kth Smallest Element in a BST'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Lowest Common Ancestor of a Binary Search Tree'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Validate Binary Search Tree'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Kth Largest Element in an Array'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Merge k Sorted Lists'
  badge: 'Hard'
@@ -1,6 +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
 sidebar:
  label: 'K Closest Points to Origin'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Binary Tree Level Order Traversal'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Count Good Nodes in Binary Tree'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Binary Tree Right Side View'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Maximum Depth of Binary Tree'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Invert Binary Tree'
  badge: 'Easy'
@@ -1,6 +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
 sidebar:
  label: 'Lowest Common Ancestor of a Binary Tree'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Implement Trie (Prefix Tree)'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Design Add and Search Words Data Structure'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Word Ladder'
  badge: 'Hard'
@@ -1,6 +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
 sidebar:
  label: 'Rotting Oranges'
  badge: 'Medium'
@@ -1,6 +1,7 @@
 ---
 title: '133. Clone Graph'
 description: Given a reference of a node in a connected undirected graph
+icon: line-dot-left-horizontal
 sidebar:
  label: 'Clone Graph'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Number of Islands'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Pacific Atlantic Water Flow'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Course Schedule'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Course Schedule II'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Number of Connected Components in an Undirected Graph'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Redundant Connection'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Combination Sum'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Permutations'
  badge: 'Medium'
@@ -1,6 +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
 sidebar:
  label: 'Subsets'
  badge: 'Medium'