Aug 04

Author: siddydutta

2025-08-August-LeetCoding-Challenge/Fruit Into Baskets.py

@@ -0,0 +1,39 @@
+from collections import Counter
+
+
+class Solution:
+    def totalFruit(self, fruits: list[int]) -> int:
+        fruit_types = Counter()
+        distinct, max_fruits = 0, 0
+
+        left, right = 0, 0
+        while right < len(fruits):
+            if fruit_types[fruits[right]] == 0:
+                distinct += 1
+            fruit_types[fruits[right]] += 1
+
+            while distinct > 2:
+                fruit_types[fruits[left]] -= 1
+                if fruit_types[fruits[left]] == 0:
+                    distinct -= 1
+                left += 1
+
+            max_fruits = max(max_fruits, right - left + 1)
+            right += 1
+
+        return max_fruits
+
+
+def main():
+    fruits = [1, 2, 1]
+    assert Solution().totalFruit(fruits) == 3
+
+    fruits = [0, 1, 2, 2]
+    assert Solution().totalFruit(fruits) == 3
+
+    fruits = [1, 2, 3, 2, 2]
+    assert Solution().totalFruit(fruits) == 4
+
+
+if __name__ == '__main__':
+    main()

2025-08-August-LeetCoding-Challenge/README.md

@@ -6,8 +6,8 @@
 | --- | --- | --- | --- |
 | August 01 | [118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | Easy | Solved |
 | August 02 | [2561. Rearranging Fruits](https://leetcode.com/problems/rearranging-fruits/) | Hard | Solved |
-| August 03 | []() |  |  |
-| August 04 | []() |  |  |
+| August 03 | [2106. Maximum Fruits Harvested After at Most K Steps](https://leetcode.com/problems/maximum-fruits-harvested-after-at-most-k-steps/) | Hard | Unsolved |
+| August 04 | [904. Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) | Medium | Solved |
 | August 05 | []() |  |  |
 | August 06 | []() |  |  |
 | August 07 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 1 | 1 | 0 |
-| Medium | 0 | 0 | 0 |
-| Hard   | 1 | 1 | 0 |
+| Medium | 1 | 1 | 0 |
+| Hard   | 2 | 1 | 1 |