Leetcode 3441. Minimum Cost Good Caption

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).