Available question text
Given a binary string where you can perform any number of cyclic rotations for free and flip individual bits at cost 1, find the minimum flips needed to make the string alternating (no equal adjacent bits). The core challenge is to compare s under all rotations against the two alternating patterns ("0101..." and "1010...") and minimize mismatches efficiently (n up to 1e5).
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 1888. Minimum Number of Flips to Make the Binary String Alternating
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source