Skip to content

Commit 1007574

Browse files
committed
Create README - LeetHub
1 parent 0c19c8d commit 1007574

File tree

1 file changed

+32
-0
lines changed
  • 1636-sort-array-by-increasing-frequency

1 file changed

+32
-0
lines changed
Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
<h2><a href="https://leetcode.com/problems/sort-array-by-increasing-frequency/">1636. Sort Array by Increasing Frequency</a></h2><h3>Easy</h3><hr><div><p>Given an array of integers <code>nums</code>, sort the array in <strong>increasing</strong> order based on the frequency of the values. If multiple values have the same frequency, sort them in <strong>decreasing</strong> order.</p>
2+
3+
<p>Return the <em>sorted array</em>.</p>
4+
5+
<p>&nbsp;</p>
6+
<p><strong class="example">Example 1:</strong></p>
7+
8+
<pre><strong>Input:</strong> nums = [1,1,2,2,2,3]
9+
<strong>Output:</strong> [3,1,1,2,2,2]
10+
<strong>Explanation:</strong> '3' has a frequency of 1, '1' has a frequency of 2, and '2' has a frequency of 3.
11+
</pre>
12+
13+
<p><strong class="example">Example 2:</strong></p>
14+
15+
<pre><strong>Input:</strong> nums = [2,3,1,3,2]
16+
<strong>Output:</strong> [1,3,3,2,2]
17+
<strong>Explanation:</strong> '2' and '3' both have a frequency of 2, so they are sorted in decreasing order.
18+
</pre>
19+
20+
<p><strong class="example">Example 3:</strong></p>
21+
22+
<pre><strong>Input:</strong> nums = [-1,1,-6,4,5,-6,1,4,1]
23+
<strong>Output:</strong> [5,-1,4,4,-6,-6,1,1,1]</pre>
24+
25+
<p>&nbsp;</p>
26+
<p><strong>Constraints:</strong></p>
27+
28+
<ul>
29+
<li><code>1 &lt;= nums.length &lt;= 100</code></li>
30+
<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
31+
</ul>
32+
</div>

0 commit comments

Comments
 (0)