🚀 LeetCode Daily Task: Minimum Index of a Valid Split (2780)

[IamShiwangi]

🚀 LeetCode Daily Task: Minimum Index of a Valid Split (2780)

Difficulty: Medium
📅 Today's Challenge: Enhance your problem-solving skills by tackling LeetCode Problem #2780.

---

#23 📝 Problem Statement

Given a 0-indexed integer array nums of length n with exactly one dominant element, an element x is considered dominant in an array if more than half of the elements in that array have the value x.

You can split nums at an index i into two subarrays:

• nums[0, ..., i]
• nums[i + 1, ..., n - 1]

A split is valid if:

• 0 <= i < n - 1
• Both subarrays have the same dominant element as the entire array.

Your task is to return the minimum index i where a valid split is possible. If no valid split exists, return -1.

---

💡 Examples

Example 1:

Input: nums = [1, 2, 2, 2]
Output: 2

Explanation:
Splitting at index 2 gives:

• Left subarray: [1, 2, 2] → Dominant element is 2 (occurs 2 times; 2 * 2 > 3).
• Right subarray: [2] → Dominant element is 2 (occurs 1 time; 1 * 2 > 1).

Both subarrays share the same dominant element (2), making it a valid split.

---

Example 2:

Input: nums = [2, 1, 3, 1, 1, 1, 7, 1, 2, 1]
Output: 4

Explanation:
Splitting at index 4 yields:

• Left subarray: [2, 1, 3, 1, 1] → Dominant element is 1 (occurs 3 times; 3 * 2 > 5).
• Right subarray: [1, 7, 1, 2, 1] → Dominant element is 1 (occurs 3 times; 3 * 2 > 5).

Both halves have the same dominant element (1), hence the split at index 4 is valid.

---

Example 3:

Input: nums = [3, 3, 3, 3, 7, 2, 2]
Output: -1

Explanation:
No index i exists where both subarrays share the same dominant element.

---

🛠 Constraints

• 1 <= nums.length <= 10^5
• 1 <= nums[i] <= 10^9
• The array nums has exactly one dominant element.

---

🎯 How to Contribute

1. Fork this Repository
   Click on the Fork button at the top-right corner of the repository.

2. Clone the Repository

   git clone https://github.com/YOUR-USERNAME/Optimism-Educator.git

3. Create a New Branch

   git checkout -b feature-leetcode2780

4. Solve the Problem
   Implement your solution in your preferred language (Python, Java, or C++). Place your solution in the appropriate file:

   /LeetCode_Daily_Tasks/Solutions/2780_Minimum_Valid_Split.py
   /LeetCode_Daily_Tasks/Solutions/2780_Minimum_Valid_Split.java
   /LeetCode_Daily_Tasks/Solutions/2780_Minimum_Valid_Split.cpp

5. Submit a Pull Request (PR)
   Once you're confident in your solution, submit a PR with your changes and be sure to add any comments or insights on your approach.

---

💬 Join the Discussion!

• Share Your Ideas: How did you approach the problem?
• Discuss Optimizations: What are some possible optimizations given the constraints?
• Ask Questions: Encountered any challenges? Share your doubts and help each other out.

Let's learn, code, and grow together! 🚀

---

Useful Links:

• [LeetCode Problem Link]
• [Optimism Educator GitHub]
• [How to Contribute Guide]

[iamAntimPal]

ok that