Problem Statement

Question 1 Implement a function that determines the minimum number of steps required to traverse through all the characters of a given uppercase string in order, starting from the character 'A'. The characters are arranged in a circular sequence from 'A' to 'Z' where 'A' and 'Z' are adjacent to each other. You can move in either direction around this circle, and each move to an adjacent character costs exactly one step. The function calculateMinSteps takes the following input: string inputStr: a string of uppercase letters to be traversed sequentially The function should return an integer representing the minimum total number of steps needed to move through all characters of the string starting from 'A'. Example inputStr = "BZA"