Available question text
Count how many length-3 contiguous segments in a circular binary array have the middle tile different from both neighbors (equivalently the two neighbors are equal and opposite to the middle).
Related questions
Continue with questions that share topics or the same question type.
- Alternating Groups II
Coding · Array · Sliding Window
- Alternating Groups III
Coding
- Alternating Digit Sum
Coding
- Assign Elements to Groups with Constraints
Coding
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 3206. Alternating Groups I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source