daily

Author: Zanger67

my-submissions/m2161 v1 O(n) runtime and space.py

@@ -0,0 +1,18 @@
+class Solution:
+    def pivotArray(self, nums: List[int], pivot: int) -> List[int]:
+        output = []
+
+        pivot_occ_cnt = 0
+        for num in nums :
+            if num < pivot :
+                output.append(num)
+            elif num == pivot :
+                pivot_occ_cnt += 1
+
+        output.extend([pivot] * pivot_occ_cnt)
+
+        for num in nums :
+            if num > pivot :
+                output.append(num)
+
+        return output

my-submissions/m2161 v2 oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def pivotArray(self, nums: List[int], pivot: int) -> List[int]:
+        return sorted(nums, key=lambda x: (x < pivot, x == pivot), reverse=True)