Minimum Operations to Transform String

Given a lowercase string s where one operation increments every occurrence of a chosen character to the next letter (with z→a), find the minimum operations to make the whole string all 'a'. The core challenge is recognizing operations can merge letters as they advance, so the minimum equals the maximum cyclic forward distance any character needs to travel to reach 'a'.