Leetcode 3400. Maximum Number of Matching Indices After Right Shifts

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.