May 11

Author: siddydutta

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

@@ -14,7 +14,7 @@
 | May 08 | [3342. Find Minimum Time to Reach Last Room II](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii/) | Medium | Solved |
 | May 09 | [3343. Count Number of Balanced Permutations](https://leetcode.com/problems/count-number-of-balanced-permutations/) | Hard | Unsolved |
 | May 10 | [2918. Minimum Equal Sum of Two Arrays After Replacing Zeros](https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/) | Medium | Solved |
-| May 11 | []() |  |  |
+| May 11 | [1550. Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | Solved |
 | May 12 | []() |  |  |
 | May 13 | []() |  |  |
 | May 14 | []() |  |  |
@@ -40,6 +40,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 2 | 2 | 0 |
+| Easy   | 3 | 3 | 0 |
 | Medium | 6 | 6 | 0 |
 | Hard   | 2 | 1 | 1 |

2025-05-May-LeetCoding-Challenge/Three Consecutive Odds.py

@@ -0,0 +1,18 @@
+class Solution:
+    def threeConsecutiveOdds(self, arr: list[int]) -> bool:
+        for i in range(0, len(arr) - 2):
+            if arr[i] & 1 != 0 and arr[i + 1] & 1 != 0 and arr[i + 2] & 1 != 0:
+                return True
+        return False
+
+
+def main():
+    arr = [2, 6, 4, 1]
+    assert Solution().threeConsecutiveOdds(arr) is False
+
+    arr = [1, 2, 34, 3, 4, 5, 7, 23, 12]
+    assert Solution().threeConsecutiveOdds(arr) is True
+
+
+if __name__ == '__main__':
+    main()