Available question text
Given a circular binary array and integer k, count how many contiguous length-k segments are alternating (every adjacent pair within the segment differs). Because of the circular wrap, this reduces to checking windows where all k-1 internal adjacent pairs are different (a sliding-window over adjacency flags).
Related questions
Continue with questions that share topics or the same question type.
- Count Number of Nice Subarrays
Coding · Array · Hash Table · Math
- Count Subarrays With Fixed Bounds
Coding · Array · Monotonic Queue · Queue
- Fruit Into Baskets
Coding · Array · Hash Table · Sliding Window
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Coding · Array · Heap (Priority Queue) · Monotonic Queue
Sources · 2 references
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 3208. Alternating Groups II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
eBay
Alternating Groups II
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 81. This is not an interview probability.
View source