Available question text
Determine whether any two distinct length-2 contiguous subarrays (adjacent pairs) in the array have the same sum — equivalently, check if any adjacent-pair sum appears more than once.
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 2395. Find Subarrays With Equal Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source