Available question text
Find the maximum length of a contiguous subarray that appears in both input arrays (the longest common substring problem for arrays); constraints (lengths ≤1000, values 0–100) make O(n·m) DP or faster rolling-hash approaches feasible.
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 718. Maximum Length of Repeated Subarray
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source