Mar 27

Author: siddydutta

2025-03-March-LeetCoding-Challenge/Minimum Index of a Valid Split.py

@@ -0,0 +1,31 @@
+from collections import defaultdict
+
+
+class Solution:
+    def minimumIndex(self, nums: list[int]) -> int:
+        n = len(nums)
+        map1, map2 = defaultdict(int), defaultdict(int)
+        for num in nums:
+            map2[num] += 1
+
+        for idx, num in enumerate(nums):
+            map1[num] += 1
+            map2[num] -= 1
+            if map1[num] * 2 > idx + 1 and map2[num] * 2 > n - idx - 1:
+                return idx
+        return -1
+
+
+def main():
+    nums = [1, 2, 2, 2]
+    assert Solution().minimumIndex(nums) == 2
+
+    nums = [2, 1, 3, 1, 1, 1, 7, 1, 2, 1]
+    assert Solution().minimumIndex(nums) == 4
+
+    nums = [3, 3, 3, 3, 7, 2, 2]
+    assert Solution().minimumIndex(nums) == -1
+
+
+if __name__ == '__main__':
+    main()

2025-03-March-LeetCoding-Challenge/README.md

@@ -30,7 +30,7 @@
 | March 24 | [3169. Count Days Without Meetings](https://leetcode.com/problems/count-days-without-meetings/) | Medium | Solved |
 | March 25 | [3394. Check if Grid can be Cut into Sections](https://leetcode.com/problems/check-if-grid-can-be-cut-into-sections/) | Medium | Solved |
 | March 26 | [2033. Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/) | Medium | Solved |
-| March 27 | []() |  |  |
+| March 27 | [2780. Minimum Index of a Valid Split](https://leetcode.com/problems/minimum-index-of-a-valid-split/) | Medium | Unsolved |
 | March 28 | []() |  |  |
 | March 29 | []() |  |  |
 | March 30 | []() |  |  |
@@ -41,5 +41,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 19 | 9 | 10 |
+| Medium | 20 | 9 | 11 |
 | Hard   | 1 | 0 | 1 |