Available question text
Find the length of the longest contiguous subarray (or substring) that is "semi-repeating" — i.e., contains at most one value/character that appears more than once. This is typically solved with a sliding-window and frequency counts to maintain the allowed-repeat constraint.
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 3641. Longest Semi-Repeating Subarray
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source