diff --git a/docs/array/1365.mdx b/docs/array/1365.mdx
index 83b2df3..f91a593 100644
--- a/docs/array/1365.mdx
+++ b/docs/array/1365.mdx
@@ -13,17 +13,17 @@ description: How Many Numbers Are Smaller Than the Current Number
## Hints
-
-
+
+
Constraints:
• `2 <= nums.length <= 500`
• `0 <= nums[i] <= 100`
-
-
+
+
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]`.
-
-
+
+
## Solution
diff --git a/docs/array/1636.mdx b/docs/array/1636.mdx
index d829a6b..b0b10ae 100644
--- a/docs/array/1636.mdx
+++ b/docs/array/1636.mdx
@@ -13,18 +13,18 @@ description: Sort Array by Increasing Frequency
## Hints
-
-
+
+
Constraints:
• `1 <= nums.length <= 100`
• `-100 <= nums[i] <= 100`
-
-
+
+
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.
Return the sorted array.
-
-
+
+
## Solution
diff --git a/docs/array/347.mdx b/docs/array/347.mdx
index 98b69de..fe2a446 100644
--- a/docs/array/347.mdx
+++ b/docs/array/347.mdx
@@ -13,21 +13,21 @@ description: Top K Frequent Elements
## Hints
-
-
+
+
Constraints:
• `1 <= nums.length <= 10^5`
• `-10^4 <= nums[i] <= 10^4`
• `k` is in the range `[1, the number of unique elements in the array]`
• It is guaranteed that the answer is unique.
-
-
+
+
Given an integer array nums and an integer `k`, return the `k` most frequent elements.
You may return the answer in any order.
Follow up: Your algorithm's time complexity must be better than `O(n log n)`, where n is the array's size.
-
-
+
+
## Solution
diff --git a/docs/hash-table/387.mdx b/docs/hash-table/387.mdx
index bef582a..11ec1bd 100644
--- a/docs/hash-table/387.mdx
+++ b/docs/hash-table/387.mdx
@@ -13,17 +13,17 @@ description: First Unique Character in a String
## Hints
-
-
+
+
Constraints:
• `1 <= s.length <= 10^5`
• `s` consists of only lowercase English letters.
-
-
+
+
Given a string `s`, find the first non-repeating character in it and return its index.
If it does not exist, return `-1`.
-
-
+
+
## Solution
diff --git a/docs/hash-table/451.mdx b/docs/hash-table/451.mdx
index bd8fcaf..63e5fed 100644
--- a/docs/hash-table/451.mdx
+++ b/docs/hash-table/451.mdx
@@ -13,18 +13,18 @@ description: Sort Characters By Frequency
## Hints
-
-
+
+
Constraints:
• `1 <= s.length <= 5 * 10^5`
• `s` consists of uppercase and lowercase English letters and digits.
-
-
+
+
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.
Return the sorted string. If there are multiple answers, return any of them.
-
-
+
+
## Solution