Minimum number of deletions so that no two consecutive are same

Given a string, find minimum number of deletions required so that there will be no two consecutive repeating characters in the string.

Examples:

Input : AAABBB
Output : 4
Explanation : New string should be AB

Input : ABABABAB
Output : 0
Explanation : There are no consecutive repeating characters.

If there are n consecutive same characters delete n-1 out of those n characters.

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// CPP code to count minimum deletions required
// so that there are no consecutive characters left
#include <bits/stdc++.h>
using namespace std;
  
int countDeletions(string str)
{
    int ans = 0;
    for (int i = 0; i < str.length() - 1; i++) 
         
        // If two consecutive characters are 
        // the same, delete one of them.
        if (str[i] == str[i + 1]) 
            ans++;
          
   return ans;
}
  
// Driver code
int main()
{
    string str = "AAABBB";
  
    // Function call to print answer
    cout << countDeletions(str);
  
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java code to count minimum deletions required
// so that there are no consecutive characters left
import java.util.*;
  
class GFG
{
  static int countDeletions(String s)
  {
    int ans = 0;
    char[] str = s.toCharArray();
  
    for (int i = 0; i < str.length - 1; i++) 
          
        // If two consecutive characters are 
        // the same, delete one of them.
        if (str[i] == str[i + 1]) 
            ans++;            
        
        return ans;
  }
  
    // Driver code
    public static void main(String[] args)
    {
      String str = "AAABBB";
      // Function call to print answer 
     System.out.println(countDeletions(str));
    }
}
/* This code is contributed by Mr. Somesh Awasthi */

chevron_right


Python

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python code to count minimum deletions required
# so that there are no consecutive characters left\
  
def countDeletions(string):
    ans = 0
    for i in range(len(string) - 1):
          
        # If two consecutive characters are 
        # the same, delete one of them.
        if (string[i] == string[i + 1]): 
            ans += 1
          
    return ans
   
# Driver code
string = "AAABBB"
  
# Function call to print answer
print countDeletions(string)
  
# This code is contributed by Sachin Bisht

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# Program to count minimum deletions
// required so that there are no
// consecutive characters left
using System;
  
class GFG
{
      
// Function for counting deletions    
static int countDeletions(String s)
{
    int ans = 0;
    char []str = s.ToCharArray();
  
    for (int i = 0; i < str.Length - 1; i++) 
          
        // If two consecutive characters are 
        // the same, delete one of them.
        if (str[i] == str[i + 1]) 
            ans++;         
      
        return ans;
}
  
    // Driver code
    public static void Main()
    {
        String str = "AAABBB";
      
        // Function call to print answer 
        Console.Write(countDeletions(str));
    }
}
  
// This code is contributed by Nitin Mittal.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP code to count minimum 
// deletions required so that
// there are no consecutive 
// characters left
  
function countDeletions($str)
{
    $ans = 0;
    for ($i = 0; $i < strlen($str) - 1; $i++) 
          
        // If two consecutive characters are 
        // the same, delete one of them.
        if ($str[$i] == $str[$i + 1]) 
            $ans++;
          
return $ans;
}
  
    // Driver Code
    $str = "AAABBB";
  
    // Function call to
    // print answer
    echo countDeletions($str);
      
// This code is contributed by nitin mittal
?>

chevron_right



Output:

4

This article is contributed by Rohit Thapliyal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

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.




My Personal Notes arrow_drop_up

Improved By : nitin mittal

Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.