Remove duplicates recursively


Eliminate the character and it's pair when they are same. Repeat it until there is no adjacent duplicates in the string
Sample input: 
 aabcddceffgge
Sample output:
bccee
b


Code:

import java.util.*;

public class Program3 {
  
    public static void removeDuplicates(StringBuilder s){
      
        int len = s.length();
        int i=0;
      
        while(i<len-1){
            if(s.charAt(i) == s.charAt(i+1)){
                s.delete(i, i+2);
                len-=2;
            }
            else{
                i++;
            }
        }
      
        System.out.println(s);
      
        if( isDuplicatesPresent(s))
            removeDuplicates(s);
      
    }
  
    public static boolean isDuplicatesPresent(StringBuilder s){
      
        boolean present = false;
      
        HashSet<Character> set = new HashSet<Character>();
      
        int len = s.length();
      
        for(int i=0; i<len; i++){
            if(!set.add(s.charAt(i)) && s.charAt(i) == s.charAt(i-1)){
                present = true;
                break;
            }
        }
      
        return present;
    }
  
    public static void main(String[] args){
        StringBuilder s;
        Scanner in = new Scanner(System.in);
      
        s = new StringBuilder(in.nextLine());
      
        removeDuplicates(s);
      
    }

}


Input:
aabcddceffgge


Output:
bccee
b



Comments

Post a Comment

Popular posts from this blog

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }         else{             temp[i] = a[small++];         }              }     for(int i=0; i<n; i++){         System.out.print(temp[i]+" ");     }            
Read more

Second Largest Element

Given an array of integers, our task is to write a program that efficiently finds the second largest element present in the array. Example: Input : arr[] = {12, 35, 1, 10, 34, 1} Output : The second largest element is 34. Code: package sap; public class SecondLargest {         public static void main(String[] args){                 int[] a = {89, 24, 75, 11, 23};         int max = Integer.MIN_VALUE, secondMax = Integer.MIN_VALUE;                 for(int i=0; i<a.length; i++){                         if(a[i] > max){                                 secondMax = max;                 max = a[i];                             }             else if(a[i] > secondMax){                 secondMax = a[i];             }                     }                 System.out.println("The second maximum element is "+secondMax);             } } Output: The second maximum element is 75
Read more

Check if a number is a power of another number

Check if a number is a power of another number Input: x = 10, y = 1 Output: True x^0 = 1 Input: x = 10, y = 1000 Output: True x^3 = 1 Input: x = 10, y = 1001 Output: False Code: package sap; public class Power {         public static void main(String[] args){                int x = 27, y = 729;                 int val = (int)Math.log(y)/ (int)Math.log(x);                 double res = Math.log(y)/Math.log(x);                 if(val == res){             System.out.println(x+" can be expressed as a power of "+y);         }                 else{             System.out.println(x +" cannot be expressed as a power of "+y);         }             } } Output: 27 can be expressed as a power of 729
Read more