Color Uniformity Challenge

Problem Statement

Color Uniformity Challenge Problem Description Elena has a string T composed of lowercase English letters, representing a sequence of colored beads. She wants to make all the beads the same color to create a uniform bracelet. To do this, she can change the color of any bead to another color, but only if that color is already present somewhere in the bracelet. Your task is to help Elena find and return an integer value representing the minimum number of bead color changes needed to make all the beads the same color. If the bracelet is already uniform (all beads are the same color), return 0. Input Specification input1: A string T , representing the sequence of bead colors. Output Specification Return an integer value representing the minimum number of bead color changes needed to make all the beads the same color. If the bracelet is already uniform (all beads are the same color), return 0. Example 1 Input: T = "rrrgggbb" Output: 5 Explanation: The bracelet has beads of three colors: 'r'