Available question text
Given an integer array, find two (contiguous) ranges with equal sum such that the distance between their starting indices is maximized, and return that maximum width; this typically reduces to using prefix sums and a hash map to track earliest/latest occurrences of each cumulative sum.
Related questions
Continue with questions that share topics or the same question type.
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 1983. Widest Pair of Indices With Equal Range Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source