You have been presented with a string $"$s$"$ composed of lowercase Latin letters.Using a single operation, you can select multiple $($one or more$)$ positions in the string such that no two selected positions are consecutive. Upon selection, you can remove the letters from the chosen positions, and the remaining segments of the string will be concatenated in their original order.What is the minimum number of operations needed to transform all the letters in string s to the same letter?nput:The first line contains an integer $"$t$"(1$ t $10^4)-$ the number of test cases.Each test case is described as follows:The only line contains a string $"$s$"$ consisting of lowercase Latin letters. The length of s ranges from $1$ to $2$ x $10^5.$ The combined length of all strings across all test cases does not exceed $2\backslash$times $10^5.$Output: For each test case, print a single integer the minimum number of operations required to change all the letters in the given string s to be the same.Let's take an exampleInputabcdefOutput$2$One way to achieve this in just $2$ operations is as follows: Initially, chooseOutput:For each test case, print a single integer $-$ the minimum number of operations required to change all the letters in the given string s to be the same.Let's take an exampleInputabcdefOutput$2$One way to achieve this in just $2$ operations is as follows: Initially, choose positions $1,4,$ and $6.$ This transforms the string into bce. Then, select positions $1$ and $3.$ This results in the string c$.$ Now, every letter in the string is the same because it's just a single letter.def calculate$\_$minimum$\_$substring$\_$change$($s$)$:# Write your code hereIs $=$ input$()$result $=$ calculate$\_$minimum$\_$substring$\_$change$($s$)$ print$($result$)$ Give me the efficient code in python of the function. by considering the question, input and output.