Merge branch 'main' of https://github.com/contextlab/leetcode-solutions into main

Author: paxtonfitzpatrick

README.md

@@ -31,6 +31,7 @@ Each day (ideally) we'll attempt the daily [leetcode](https://leetcode.com) prob
 | July 20, 2024 | [1605](https://leetcode.com/problems/find-valid-matrix-given-row-and-column-sums/description/?envType=daily-question) | [Click here](https://github.com/ContextLab/leetcode-solutions/tree/main/problems/1605) | 🟡 Medium |
 | July 21, 2024 | [2392](https://leetcode.com/problems/build-a-matrix-with-conditions/description/?envType=daily-question) | [Click here](https://github.com/ContextLab/leetcode-solutions/tree/main/problems/2392) | 🔴 Hard |
 | July 22, 2024 | [2418](https://leetcode.com/problems/sort-the-people/description/?envType=daily-question) | [Click here](https://github.com/ContextLab/leetcode-solutions/tree/main/problems/2418) | 🟢 Easy |
+| July 23, 2024 | [1636](https://leetcode.com/problems/sort-array-by-increasing-frequency/description/?envType=daily-question) | [Click here](https://github.com/ContextLab/leetcode-solutions/tree/main/problems/1636) | 🟢 Easy |
 
 # Join our discussion!
 

problems/1636/jeremymanning.md

@@ -0,0 +1,48 @@
+# [Problem 1636: Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/description/?envType=daily-question)
+
+## Initial thoughts (stream-of-consciousness)
+- We can make a hash table with the counts of each item
+- Then we'll make an array `x = [[counts[i], i] for i in nums]`
+- Then we can return `[n[1] for n in sorted(x, key=lambda x: [x[0], -x[1]])]`
+
+## Refining the problem, round 2 thoughts
+- No special cases to account for that I can think of...
+
+## Attempted solution(s)
+```python
+class Solution:
+    def frequencySort(self, nums: List[int]) -> List[int]:
+        counts = {}
+        for n in nums:
+            if n in counts:
+                counts[n] += 1
+            else:
+                counts[n] = 1
+        
+        x = [[counts[i], i] for i in nums]
+        return [n[1] for n in sorted(x, key=lambda x: [x[0], -x[1]])]
+```
+- Given test cases pass
+- Submitting...
+
+![Screenshot 2024-07-22 at 8 13 33 PM](https://github.com/user-attachments/assets/2a22346c-4997-486e-a79d-8e473d4b78b3)
+
+Solved!
+
+- Actually: Maybe we can save some memory by not re-storing the counts:
+```python
+class Solution:
+    def frequencySort(self, nums: List[int]) -> List[int]:
+        counts = {}
+        for n in nums:
+            if n in counts:
+                counts[n] += 1
+            else:
+                counts[n] = 1
+        
+        return [n for n in sorted(nums, key=lambda x: [counts[x], -x])]
+```
+
+![Screenshot 2024-07-22 at 8 16 25 PM](https://github.com/user-attachments/assets/db39e587-23c4-4974-bcd6-7ca5ab2c48c0)
+
+Nope, not helpful 🙃!