Available question text
Given a string of 'X' and 'O', compute the minimum number of operations (each converts any chosen length-3 contiguous substring to 'O') needed to turn all characters to 'O'. This is equivalent to covering all 'X' positions with the fewest length-3 windows — a simple greedy/interval-covering problem.
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 2027. Minimum Moves to Convert String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source