Available question text
Given a string where each character can be shifted left/right in the alphabet at unit cost, compute the minimum total shifts to make every letter occur in contiguous groups of length at least three, and return the lexicographically smallest resulting string among all minimum-cost solutions (or "" if impossible).
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 3441. Minimum Cost Good Caption
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source