docs: add sidebar labels and reorganize solution docs into category folders

docs/solutions/(array)/121-best-time-to-buy-and-sell-stock.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Best Time to Buy and Sell Stock'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/1365-how-many-numbers-are-smaller-than-the-current-number.mdx

@@ -2,6 +2,7 @@
 title: '1365. How Many Numbers Are Smaller Than the Current Number'
 description: Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i]
 sidebar:
+  label: 'How Many Numbers Are Smaller Than the Current Number'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/1413-minimum-value-to-get-positive-step-by-step-sum.mdx

@@ -2,6 +2,7 @@
 title: '1413. Minimum Value to Get Positive Step by Step Sum'
 description: Given an array of integers nums, you start with an initial positive value startValue
 sidebar:
+  label: 'Minimum Value to Get Positive Step by Step Sum'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/1426-counting-elements.mdx

@@ -2,6 +2,7 @@
 title: '1426. Counting Elements'
 description: Given an integer array arr, count how many elements x there are, such that x + 1 is also in arr. If there are duplicates in arr, count them separately
 sidebar:
+  label: 'Counting Elements'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/1480-running-sum-of-1d-array.mdx

@@ -2,6 +2,7 @@
 title: '1480. Running Sum of 1d Array'
 description: Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i])
 sidebar:
+  label: 'Running Sum of 1d Array'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/15-3sum.mdx

@@ -2,6 +2,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
 sidebar:
+  label: '3Sum'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/1636-sort-array-by-increasing-frequency.mdx

@@ -2,6 +2,7 @@
 title: '1636. Sort Array by Increasing Frequency'
 description: Given an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, sort them in decreasing order
 sidebar:
+  label: 'Sort Array by Increasing Frequency'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/167-two-sum-ii-input-array-is-sorted.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Two Sum II - Input Array Is Sorted'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/189-rotate-array.mdx

@@ -2,6 +2,7 @@
 title: '189. Rotate Array'
 description: Given an integer array nums, rotate the array to the right by k steps, where k is non-negative
 sidebar:
+  label: 'Rotate Array'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/2090-k-radius-subarray-averages.mdx

@@ -2,6 +2,7 @@
 title: '2090. K Radius Subarray Averages'
 description: You are given a 0-indexed array nums of n integers, and an integer k
 sidebar:
+  label: 'K Radius Subarray Averages'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/217-contains-duplicate.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Contains Duplicate'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/238-product-of-array-except-self.mdx

@@ -2,6 +2,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]
 sidebar:
+  label: 'Product of Array Except Self'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/268-missing-number.mdx

@@ -2,6 +2,7 @@
 title: '268. Missing Number'
 description: Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array
 sidebar:
+  label: 'Missing Number'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/303-range-sum-query-immutable.mdx

@@ -2,6 +2,7 @@
 title: '303. Range Sum Query - Immutable'
 description: Given an integer array nums, handle multiple queries of the following type
 sidebar:
+  label: 'Range Sum Query - Immutable'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/33-search-in-rotated-sorted-array.mdx

@@ -2,6 +2,7 @@
 title: '33. Search in Rotated Sorted Array'
 description: There is an integer array nums sorted in ascending order (with distinct values)
 sidebar:
+  label: 'Search in Rotated Sorted Array'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/347-top-k-frequent-elements.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Top K Frequent Elements'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/42-trapping-rain-water.mdx

@@ -2,6 +2,7 @@
 title: '42. Trapping Rain Water'
 description: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining
 sidebar:
+  label: 'Trapping Rain Water'
   badge: 'Hard'
 ---
 

docs/solutions/(array)/49-group-anagrams.mdx

@@ -2,6 +2,7 @@
 title: '49. Group Anagrams'
 description: Given an array of strings strs, group the anagrams together. You can return the answer in any order
 sidebar:
+  label: 'Group Anagrams'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/560-subarray-sum-equals-k.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Subarray Sum Equals K'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/704-binary-search.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Binary Search'
   badge: 'Easy'
 ---
 

docs/solutions/(array)/875-koko-eating-bananas.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Koko Eating Bananas'
   badge: 'Medium'
 ---
 

docs/solutions/(array)/977-squares-of-a-sorted-array.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Squares of a Sorted Array'
   badge: 'Easy'
 ---
 

docs/solutions/(hash-table)/1832-check-if-the-sentence-is-pangram.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Check if the Sentence Is Pangram'
   badge: 'Easy'
 ---
 

docs/solutions/(hash-table)/242-valid-anagram.mdx

@@ -2,6 +2,7 @@
 title: '242. Valid Anagram'
 description: Given two strings s and t, return true if t is an anagram of s, and false otherwise
 sidebar:
+  label: 'Valid Anagram'
   badge: 'Easy'
 ---
 

docs/solutions/(hash-table)/387-first-unique-character-in-a-string.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'First Unique Character in a String'
   badge: 'Easy'
 ---
 

docs/solutions/(hash-table)/451-sort-characters-by-frequency.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Sort Characters By Frequency'
   badge: 'Medium'
 ---
 

docs/solutions/(two-pointers)/125-valid-palindrome.mdx

@@ -2,6 +2,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
 sidebar:
+  label: 'Valid Palindrome'
   badge: 'Easy'
 ---
 

docs/solutions/(two-pointers)/344-reverse-string.mdx

@@ -2,6 +2,7 @@
 title: '344. Reverse String'
 description: Write a function that reverses a string. The input string is given as an array of characters s
 sidebar:
+  label: 'Reverse String'
   badge: 'Easy'
 ---