py/leetcode
1
0 Fork 0
mirror of https://github.com/prdlk/leetcode.git synced 2026-11-03 05:27:36 +00:00
Code Issues Packages Projects Releases Wiki Activity

docs: standardize accordion components in problem hints

Browse Source
This commit is contained in:
Prad Nukala committed 2026-07-14 11:10:30 -04:00
1 parent 3e4c8c7065
commit d322faa3a8
5 files changed
+30 -30
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

docs/array/1365.mdx
+6 -6
View File
@@ -13,17 +13,17 @@ description: How Many Numbers Are Smaller Than the Current Number
## Hints
<Accordions type="single">
<Accordion title="Constraints">
<Accordion type="single">
<AccordionItem title="Constraints">
Constraints:
• `2 <= nums.length <= 500`
• `0 <= nums[i] <= 100`
</Accordion>
<Accordion title="Problem Statement">
</AccordionItem>
<AccordionItem title="Problem Statement">
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]`.
</Accordion>
</Accordions>
</AccordionItem>
</Accordion>
## Solution
docs/array/1636.mdx
+6 -6
View File
@@ -13,18 +13,18 @@ description: Sort Array by Increasing Frequency
## Hints
<Accordions type="single">
<Accordion title="Constraints">
<Accordion type="single">
<AccordionItem title="Constraints">
Constraints:
• `1 <= nums.length <= 100`
• `-100 <= nums[i] <= 100`
</Accordion>
<Accordion title="Problem Statement">
</AccordionItem>
<AccordionItem title="Problem Statement">
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.
</Accordion>
</Accordions>
</AccordionItem>
</Accordion>
## Solution
docs/array/347.mdx
+6 -6
View File
@@ -13,21 +13,21 @@ description: Top K Frequent Elements
## Hints
<Accordions type="single">
<Accordion title="Constraints">
<Accordion type="single">
<AccordionItem title="Constraints">
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.
</Accordion>
<Accordion title="Problem Statement">
</AccordionItem>
<AccordionItem title="Problem Statement">
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.
</Accordion>
</Accordions>
</AccordionItem>
</Accordion>
## Solution