Mar 3

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Partition Array According to Given Pivot.py

@@ -0,0 +1,25 @@
+class Solution:
+    def pivotArray(self, nums: list[int], pivot: int) -> list[int]:
+        lesser, equal, greater = [], [], []
+        for num in nums:
+            if num < pivot:
+                lesser.append(num)
+            elif num == pivot:
+                equal.append(num)
+            else:
+                greater.append(num)
+        return lesser + equal + greater
+
+
+def main():
+    nums = [9, 12, 5, 10, 14, 3, 10]
+    pivot = 10
+    assert Solution().pivotArray(nums, pivot) == [9, 5, 3, 10, 10, 12, 14]
+
+    nums = [-3, 4, 3, 2]
+    pivot = 2
+    assert Solution().pivotArray(nums, pivot) == [-3, 2, 4, 3]
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -6,7 +6,7 @@
 | --- | --- | --- | --- |
 | March 01 | [2460. Apply Operations to an Array](https://leetcode.com/problems/apply-operations-to-an-array/) | Easy | Solved |
 | March 02 | [2570. Merge Two 2D Arrays by Summing Values](https://leetcode.com/problems/merge-two-2d-arrays-by-summing-values/) | Easy | Solved |
-| March 03 | []() |  |  |
+| March 03 | [2161. Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/) | Medium | Solved |
 | March 04 | []() |  |  |
 | March 05 | []() |  |  |
 | March 06 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 2 | 2 | 0 |
-| Medium | 0 | 0 | 0 |
+| Medium | 1 | 1 | 0 |
 | Hard   | 0 | 0 | 0 |