May 03

Author: siddydutta

2025-05-May-LeetCoding-Challenge/Minimum Domino Rotations For Equal Row.py

@@ -0,0 +1,20 @@
+class Solution:
+    def minDominoRotations(self, tops: list[int], bottoms: list[int]) -> int:
+        for n in (tops[0], bottoms[0]):
+            if all(n in pairs for pairs in zip(tops, bottoms)):
+                return len(tops) - max(tops.count(n), bottoms.count(n))
+        return -1
+
+
+def main():
+    tops = [2, 1, 2, 4, 2, 2]
+    bottoms = [5, 2, 6, 2, 3, 2]
+    assert Solution().minDominoRotations(tops, bottoms) == 2
+
+    tops = [3, 5, 1, 2, 3]
+    bottoms = [3, 6, 3, 3, 4]
+    assert Solution().minDominoRotations(tops, bottoms) == -1
+
+
+if __name__ == '__main__':
+    main()

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

@@ -6,7 +6,7 @@
 | --- | --- | --- | --- |
 | May 01 | [2071. Maximum Number of Tasks You Can Assign](https://leetcode.com/problems/maximum-number-of-tasks-you-can-assign/) | Hard | Solved |
 | May 02 | [838. Push Dominoes](https://leetcode.com/problems/push-dominoes/) | Medium | Solved |
-| May 03 | []() |  |  |
+| May 03 | [1007. Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | Medium | Solved |
 | May 04 | []() |  |  |
 | May 05 | []() |  |  |
 | May 06 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 0 | 0 | 0 |
-| Medium | 1 | 1 | 0 |
+| Medium | 2 | 2 | 0 |
 | Hard   | 1 | 1 | 0 |