Available question text
Given two equal-length arrays (or strings), find the circular right-shift of one array that maximizes the number of indices where the shifted array equals the other, and return that maximum count — the challenge is to compute this efficiently for large n by reasoning about relative index offsets.
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 3400. Maximum Number of Matching Indices After Right Shifts
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source