Day 27 : Minimum index of a valid split

Author: rishisrivastava07

problem-of-the-day/March/27_minIndexOfAValidSplit.cpp

@@ -0,0 +1,25 @@
+class Solution {
+    public:
+        int minimumIndex(vector<int>& nums) {
+            int n = nums.size();
+            unordered_map<int, int> left_mp; // keep one element in the left map
+            unordered_map<int, int> right_mp; // populate the 1 to n-1 element in the right map
+            for(int i = 0; i < n; i++){
+                right_mp[nums[i]] += 1;
+            }
+    
+            for(int i = 0; i < n; i++){
+                left_mp[nums[i]]++;
+                right_mp[nums[i]]--;
+    
+                int n1 = i+1;
+                int n2 = n-i-1;
+    
+                if(left_mp[nums[i]] > n1/2 && right_mp[nums[i]] > n2/2){
+                    return i;
+                }
+            }
+    
+            return -1;
+        }
+    };