Available question text
Given a binary target string and an all-zero source, you may flip any suffix [i..n-1]; find the minimum number of such suffix-flip operations to obtain target. This is a greedy/observation problem: the optimal number equals the count of bit transitions in target when including the initial change from '0'.
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 1529. Minimum Suffix Flips
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source