Jun 02

Author: siddydutta

2025-06-June-LeetCoding-Challenge/Candy.py

@@ -0,0 +1,25 @@
+class Solution:
+    def candy(self, ratings: list[int]) -> int:
+        n = len(ratings)
+        candies = [1] * n  # every child must have atleast one candy
+        # first pass -> going from left to right to satisfy condition
+        for i in range(0, n - 1):
+            if ratings[i + 1] > ratings[i]:
+                candies[i + 1] = max(candies[i + 1], candies[i] + 1)
+        # second pass -> going from right to left to satisfy condition
+        for i in range(n - 2, -1, -1):
+            if ratings[i] > ratings[i + 1]:
+                candies[i] = max(candies[i], candies[i + 1] + 1)
+        return sum(candies)
+
+
+def main():
+    ratings = [1, 0, 2]
+    assert Solution().candy(ratings) == 5
+
+    ratings = [1, 2, 2]
+    assert Solution().candy(ratings) == 4
+
+
+if __name__ == '__main__':
+    main()

2025-06-June-LeetCoding-Challenge/README.md

@@ -5,7 +5,7 @@
 | Day | Problem | Level | Status |
 | --- | --- | --- | --- |
 | June 01 | [2929. Distribute Candies Among Children II](https://leetcode.com/problems/distribute-candies-among-children-ii/) | Medium | Unsolved |
-| June 02 | []() |  |  |
+| June 02 | [135. Candy](https://leetcode.com/problems/candy/) | Hard | Solved |
 | June 03 | []() |  |  |
 | June 04 | []() |  |  |
 | June 05 | []() |  |  |
@@ -41,4 +41,4 @@
 | ---    | --- | --- | --- |
 | Easy   | 0 | 0 | 0 |
 | Medium | 1 | 0 | 1 |
-| Hard   | 0 | 0 | 0 |
+| Hard   | 1 | 1 | 0 |