Available question text
Find the leftmost index in an integer array where the sum of elements to its left equals the sum of elements to its right, returning -1 if none exists. This "pivot" can be found efficiently by comparing a running left sum with the total sum.
Related questions
Continue with questions that share topics or the same question type.
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Find All Duplicates in an Array
Coding
- Find All K-Distant Indices in an Array
Coding
- Find All Lonely Numbers in the Array
Coding · Array · Counting · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1991. Find the Middle Index in Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source