May 17

Author: siddydutta

2025-05-May-LeetCoding-Challenge/README.md

@@ -20,7 +20,7 @@
 | May 14 | [3337. Total Characters in String After Transformations II](https://leetcode.com/problems/total-characters-in-string-after-transformations-ii/) | Hard | Unsolved |
 | May 15 | [2900. Longest Unequal Adjacent Groups Subsequence I](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-i/) | Easy | Solved |
 | May 16 | [2901. Longest Unequal Adjacent Groups Subsequence II](https://leetcode.com/problems/longest-unequal-adjacent-groups-subsequence-ii/) | Medium | Unsolved |
-| May 17 | []() |  |  |
+| May 17 | [75. Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | Solved |
 | May 18 | []() |  |  |
 | May 19 | []() |  |  |
 | May 20 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 4 | 4 | 0 |
-| Medium | 8 | 7 | 1 |
+| Medium | 9 | 7 | 2 |
 | Hard   | 3 | 1 | 2 |

2025-05-May-LeetCoding-Challenge/Sort Colors.py

@@ -0,0 +1,28 @@
+class Solution:
+    def sortColors(self, nums: list[int]) -> None:
+        left, right = 0, len(nums) - 1
+        ptr = 0
+        while ptr <= right:
+            if nums[ptr] == 0:
+                nums[left], nums[ptr] = nums[ptr], nums[left]
+                left += 1
+                ptr += 1
+            elif nums[ptr] == 1:
+                ptr += 1
+            elif nums[ptr] == 2:
+                nums[right], nums[ptr] = nums[ptr], nums[right]
+                right -= 1
+
+
+def main():
+    nums = [2, 0, 2, 1, 1, 0]
+    Solution().sortColors(nums)
+    assert nums == [0, 0, 1, 1, 2, 2]
+
+    nums = [2, 0, 1]
+    Solution().sortColors(nums)
+    assert nums == [0, 1, 2]
+
+
+if __name__ == '__main__':
+    main()