class Solution {
    public int solution(String name) {
        int answer = 0;
        int len = name.length();
        
        // if name only consists of 'A' 
        //      -> the minimum movement = just go right continuously 
        int min = len - 1;
        
        for (int i = 0; i < len; i++) {
            
             // get each char from String
            char c = name.charAt(i);
            
            // decide to move 'up or down'
            // up : c - 'A'
            // down : 'Z' - c + 1
            int move = (c - 'A' < 'Z' - c + 1) ? (c - 'A') : ('Z' - c + 1);
            answer += move;
            
            // decide to move 'right or left'
            
            // 1. first, go right -> count index by using nextIndex
            int nextIndex = i + 1;
            while (nextIndex < len && name.charAt(nextIndex) == 'A') 
                nextIndex++;
            
            // 2. compare which is the minimum value and update 'min'
            // - go right : min
            // - go back to left : (i * 2) + len - nextIndex
            //           -> i * 2 : go right + go back to left
            //           -> len - nextIndex : count from last index
            min = Math.min(min, (i * 2) + len - nextIndex);
        }
        
        answer += min;
        
        return answer;
    }
}