diff --git a/docs/solutions/121-best-time-to-buy-and-sell-stock.mdx b/docs/solutions/(array)/121-best-time-to-buy-and-sell-stock.mdx similarity index 95% rename from docs/solutions/121-best-time-to-buy-and-sell-stock.mdx rename to docs/solutions/(array)/121-best-time-to-buy-and-sell-stock.mdx index 0046d3b..d9c2243 100644 --- a/docs/solutions/121-best-time-to-buy-and-sell-stock.mdx +++ b/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' --- diff --git a/docs/solutions/1365-how-many-numbers-are-smaller-than-the-current-number.mdx b/docs/solutions/(array)/1365-how-many-numbers-are-smaller-than-the-current-number.mdx similarity index 96% rename from docs/solutions/1365-how-many-numbers-are-smaller-than-the-current-number.mdx rename to docs/solutions/(array)/1365-how-many-numbers-are-smaller-than-the-current-number.mdx index 61f5e87..e250cd2 100644 --- a/docs/solutions/1365-how-many-numbers-are-smaller-than-the-current-number.mdx +++ b/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' --- diff --git a/docs/solutions/1413-minimum-value-to-get-positive-step-by-step-sum.mdx b/docs/solutions/(array)/1413-minimum-value-to-get-positive-step-by-step-sum.mdx similarity index 95% rename from docs/solutions/1413-minimum-value-to-get-positive-step-by-step-sum.mdx rename to docs/solutions/(array)/1413-minimum-value-to-get-positive-step-by-step-sum.mdx index 2d1a9c5..5d4bf8b 100644 --- a/docs/solutions/1413-minimum-value-to-get-positive-step-by-step-sum.mdx +++ b/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' --- diff --git a/docs/solutions/1426-counting-elements.mdx b/docs/solutions/(array)/1426-counting-elements.mdx similarity index 96% rename from docs/solutions/1426-counting-elements.mdx rename to docs/solutions/(array)/1426-counting-elements.mdx index 1f25f31..ae081da 100644 --- a/docs/solutions/1426-counting-elements.mdx +++ b/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' --- diff --git a/docs/solutions/1480-running-sum-of-1d-array.mdx b/docs/solutions/(array)/1480-running-sum-of-1d-array.mdx similarity index 96% rename from docs/solutions/1480-running-sum-of-1d-array.mdx rename to docs/solutions/(array)/1480-running-sum-of-1d-array.mdx index b4872fc..a3aef67 100644 --- a/docs/solutions/1480-running-sum-of-1d-array.mdx +++ b/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' --- diff --git a/docs/solutions/15-3sum.mdx b/docs/solutions/(array)/15-3sum.mdx similarity index 98% rename from docs/solutions/15-3sum.mdx rename to docs/solutions/(array)/15-3sum.mdx index 3961664..f2baa05 100644 --- a/docs/solutions/15-3sum.mdx +++ b/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' --- diff --git a/docs/solutions/1636-sort-array-by-increasing-frequency.mdx b/docs/solutions/(array)/1636-sort-array-by-increasing-frequency.mdx similarity index 95% rename from docs/solutions/1636-sort-array-by-increasing-frequency.mdx rename to docs/solutions/(array)/1636-sort-array-by-increasing-frequency.mdx index 2aa0228..eafaf3a 100644 --- a/docs/solutions/1636-sort-array-by-increasing-frequency.mdx +++ b/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' --- diff --git a/docs/solutions/167-two-sum-ii-input-array-is-sorted.mdx b/docs/solutions/(array)/167-two-sum-ii-input-array-is-sorted.mdx similarity index 97% rename from docs/solutions/167-two-sum-ii-input-array-is-sorted.mdx rename to docs/solutions/(array)/167-two-sum-ii-input-array-is-sorted.mdx index cec8b15..9731302 100644 --- a/docs/solutions/167-two-sum-ii-input-array-is-sorted.mdx +++ b/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' --- diff --git a/docs/solutions/189-rotate-array.mdx b/docs/solutions/(array)/189-rotate-array.mdx similarity index 97% rename from docs/solutions/189-rotate-array.mdx rename to docs/solutions/(array)/189-rotate-array.mdx index 6702d86..260493f 100644 --- a/docs/solutions/189-rotate-array.mdx +++ b/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' --- diff --git a/docs/solutions/2090-k-radius-subarray-averages.mdx b/docs/solutions/(array)/2090-k-radius-subarray-averages.mdx similarity index 97% rename from docs/solutions/2090-k-radius-subarray-averages.mdx rename to docs/solutions/(array)/2090-k-radius-subarray-averages.mdx index aceecb6..652f779 100644 --- a/docs/solutions/2090-k-radius-subarray-averages.mdx +++ b/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' --- diff --git a/docs/solutions/217-contains-duplicate.mdx b/docs/solutions/(array)/217-contains-duplicate.mdx similarity index 96% rename from docs/solutions/217-contains-duplicate.mdx rename to docs/solutions/(array)/217-contains-duplicate.mdx index 883e8cd..bde42cd 100644 --- a/docs/solutions/217-contains-duplicate.mdx +++ b/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' --- diff --git a/docs/solutions/238-product-of-array-except-self.mdx b/docs/solutions/(array)/238-product-of-array-except-self.mdx similarity index 97% rename from docs/solutions/238-product-of-array-except-self.mdx rename to docs/solutions/(array)/238-product-of-array-except-self.mdx index 41458e1..647c1ea 100644 --- a/docs/solutions/238-product-of-array-except-self.mdx +++ b/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' --- diff --git a/docs/solutions/268-missing-number.mdx b/docs/solutions/(array)/268-missing-number.mdx similarity index 98% rename from docs/solutions/268-missing-number.mdx rename to docs/solutions/(array)/268-missing-number.mdx index 675a663..36100cf 100644 --- a/docs/solutions/268-missing-number.mdx +++ b/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' --- diff --git a/docs/solutions/303-range-sum-query-immutable.mdx b/docs/solutions/(array)/303-range-sum-query-immutable.mdx similarity index 97% rename from docs/solutions/303-range-sum-query-immutable.mdx rename to docs/solutions/(array)/303-range-sum-query-immutable.mdx index 4df964b..bbf2916 100644 --- a/docs/solutions/303-range-sum-query-immutable.mdx +++ b/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' --- diff --git a/docs/solutions/33-search-in-rotated-sorted-array.mdx b/docs/solutions/(array)/33-search-in-rotated-sorted-array.mdx similarity index 97% rename from docs/solutions/33-search-in-rotated-sorted-array.mdx rename to docs/solutions/(array)/33-search-in-rotated-sorted-array.mdx index cd8b8db..185460a 100644 --- a/docs/solutions/33-search-in-rotated-sorted-array.mdx +++ b/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' --- diff --git a/docs/solutions/347-top-k-frequent-elements.mdx b/docs/solutions/(array)/347-top-k-frequent-elements.mdx similarity index 96% rename from docs/solutions/347-top-k-frequent-elements.mdx rename to docs/solutions/(array)/347-top-k-frequent-elements.mdx index 630e8a6..cf4d31c 100644 --- a/docs/solutions/347-top-k-frequent-elements.mdx +++ b/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' --- diff --git a/docs/solutions/42-trapping-rain-water.mdx b/docs/solutions/(array)/42-trapping-rain-water.mdx similarity index 96% rename from docs/solutions/42-trapping-rain-water.mdx rename to docs/solutions/(array)/42-trapping-rain-water.mdx index d3397fb..5638fd3 100644 --- a/docs/solutions/42-trapping-rain-water.mdx +++ b/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' --- diff --git a/docs/solutions/49-group-anagrams.mdx b/docs/solutions/(array)/49-group-anagrams.mdx similarity index 98% rename from docs/solutions/49-group-anagrams.mdx rename to docs/solutions/(array)/49-group-anagrams.mdx index e1be071..75c52bc 100644 --- a/docs/solutions/49-group-anagrams.mdx +++ b/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' --- diff --git a/docs/solutions/560-subarray-sum-equals-k.mdx b/docs/solutions/(array)/560-subarray-sum-equals-k.mdx similarity index 96% rename from docs/solutions/560-subarray-sum-equals-k.mdx rename to docs/solutions/(array)/560-subarray-sum-equals-k.mdx index 3c8b7af..2678d07 100644 --- a/docs/solutions/560-subarray-sum-equals-k.mdx +++ b/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' --- diff --git a/docs/solutions/704-binary-search.mdx b/docs/solutions/(array)/704-binary-search.mdx similarity index 98% rename from docs/solutions/704-binary-search.mdx rename to docs/solutions/(array)/704-binary-search.mdx index d637de1..f92972b 100644 --- a/docs/solutions/704-binary-search.mdx +++ b/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' --- diff --git a/docs/solutions/875-koko-eating-bananas.mdx b/docs/solutions/(array)/875-koko-eating-bananas.mdx similarity index 97% rename from docs/solutions/875-koko-eating-bananas.mdx rename to docs/solutions/(array)/875-koko-eating-bananas.mdx index efeaa37..7682605 100644 --- a/docs/solutions/875-koko-eating-bananas.mdx +++ b/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' --- diff --git a/docs/solutions/977-squares-of-a-sorted-array.mdx b/docs/solutions/(array)/977-squares-of-a-sorted-array.mdx similarity index 97% rename from docs/solutions/977-squares-of-a-sorted-array.mdx rename to docs/solutions/(array)/977-squares-of-a-sorted-array.mdx index b8a7dc1..a79dd32 100644 --- a/docs/solutions/977-squares-of-a-sorted-array.mdx +++ b/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' --- diff --git a/docs/solutions/1832-check-if-the-sentence-is-pangram.mdx b/docs/solutions/(hash-table)/1832-check-if-the-sentence-is-pangram.mdx similarity index 95% rename from docs/solutions/1832-check-if-the-sentence-is-pangram.mdx rename to docs/solutions/(hash-table)/1832-check-if-the-sentence-is-pangram.mdx index 62cbc6d..e669c06 100644 --- a/docs/solutions/1832-check-if-the-sentence-is-pangram.mdx +++ b/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' --- diff --git a/docs/solutions/242-valid-anagram.mdx b/docs/solutions/(hash-table)/242-valid-anagram.mdx similarity index 97% rename from docs/solutions/242-valid-anagram.mdx rename to docs/solutions/(hash-table)/242-valid-anagram.mdx index 68ba1e2..dff1203 100644 --- a/docs/solutions/242-valid-anagram.mdx +++ b/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' --- diff --git a/docs/solutions/387-first-unique-character-in-a-string.mdx b/docs/solutions/(hash-table)/387-first-unique-character-in-a-string.mdx similarity index 95% rename from docs/solutions/387-first-unique-character-in-a-string.mdx rename to docs/solutions/(hash-table)/387-first-unique-character-in-a-string.mdx index 093edb7..065a16c 100644 --- a/docs/solutions/387-first-unique-character-in-a-string.mdx +++ b/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' --- diff --git a/docs/solutions/451-sort-characters-by-frequency.mdx b/docs/solutions/(hash-table)/451-sort-characters-by-frequency.mdx similarity index 97% rename from docs/solutions/451-sort-characters-by-frequency.mdx rename to docs/solutions/(hash-table)/451-sort-characters-by-frequency.mdx index e77c2b5..a0415a1 100644 --- a/docs/solutions/451-sort-characters-by-frequency.mdx +++ b/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' --- diff --git a/docs/solutions/125-valid-palindrome.mdx b/docs/solutions/(two-pointers)/125-valid-palindrome.mdx similarity index 97% rename from docs/solutions/125-valid-palindrome.mdx rename to docs/solutions/(two-pointers)/125-valid-palindrome.mdx index 0733180..027d09f 100644 --- a/docs/solutions/125-valid-palindrome.mdx +++ b/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' --- diff --git a/docs/solutions/344-reverse-string.mdx b/docs/solutions/(two-pointers)/344-reverse-string.mdx similarity index 97% rename from docs/solutions/344-reverse-string.mdx rename to docs/solutions/(two-pointers)/344-reverse-string.mdx index 9b13591..9e94efe 100644 --- a/docs/solutions/344-reverse-string.mdx +++ b/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' ---