Count the minimum number of groups formed in a string
Given a string ‘S’ which comprises two or more uppercase English letters. The task is to count the minimum number of groups required to completely cover the string by replacing consecutive characters with the same single character.
Input : S = "TTWWW" Output : 2 Explanation : There are 2 groups formed. One by covering the 2 consecutive T and the other by 3 consecutive W. Input : S = "FFMMMF" Output : 3 Explanation : Minimum number of groups formed is 3 that is two F's, three M's and one F . Note: Three F's were not included in one group because they are not consecutive in the string s.
To solve the problem mentioned above the main idea is to compare the adjacent characters in the string ‘S’ one by one. If for instance, the characters are different that is the consecutive letters of the string are not the same then, the counter for the total group formed is incremented by 1 and so on until we reach the length if the string.
Below is the implementation of the above-mentioned approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course.