Super Reduced String Problem Solution

HackeRank Super Reduced String Problem
Steve has a string, , consisting of  lowercase English alphabetic letters. In one operation, he can delete any pair of adjacent letters with same value. For example, string "aabcc" would become either "aab" or "bcc" after  operation.
Steve wants to reduce  as much as possible. To do this, he will repeat the above operation as many times as it can be performed. Help Steve out by finding and printing 's non-reducible form!
Note: If the final string is empty, print Empty String .

----------------------------------------In This Solution Solved 16/16 Test Cases-------------------------
#include <stdio.h>
#include <string.h>
#include <math.h>
/**
 * Created by abhimanoj on 09/2/16.
 */
char str[101];
void removeCharacter(int i)
{
    for(;str[i]!='\0';)
    {
        str[i]=str[i+2];
        str[i+1]=str[i+3];
        i+=2;

    }
}

int main()
{
    int i=0,len=0;
    scanf("%s",str);
    for(;str[len]!='\0';len++);
    for(;i<len;)
    {
        if((str[i] == str[i+1] ) && (i >= 0) && str[i]!='\0')
        {
            removeCharacter(i);
            i--;
        }
        else
        {
            i++;
        }
    }
    if(str[0]=='\0')
       printf("Empty String");
    else
       printf("%s\n",str);

    return 0;
}


-----------------------------------In This Solution Only Solved 11/16 Test Cases-------------------------------
#include <stdio.h>
#include <string.h>
#include <math.h>
/**
 * Created by abhimanoj on 09/2/16.
 */
int main() {

    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
 
    char str[101];
    int countStr[26]={0};
    int i,k=0;
    scanf("%s",str);
    for(i=0;str[i]!='\0';i++){
        if(str[i]==str[i+1]){
        countStr[str[i]-97]+=1;
        i=0;
        }
    }
    for(i=0;i<26;i++){
        if(!(countStr[i]%2==0)){
            printf("%c",97+i);
            k++;
        }        
    }
    if(k==0)
        printf("Empty String");
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Cut the sticks

Cut the sticks     You are given   sticks, where the  length  of each stick is a positive integer. A  cut operation  is performed on the sticks such that all of them are reduced by the length of the smallest stick. ---Solution--- #include <cmath> #include <cstdio> #include <vector> #include <iostream> #include <algorithm> using namespace std; int compare (const void * a, const void * b) {   return ( *(int*)a - *(int*)b ); } int main() {     /* Enter your code here. Read input from STDIN. Print output to STDOUT */        int element,k;     cin>>element;     int array[element];     for(int i=0;i<element;i++)         {             cin>>array[i];     }      qsort (array, element, sizeof(int), compare);     int p=element;     for(int i=0;i...
Read more

Find Digits

Find Digits Given an integer,  , traverse its digits ( 1 , 2 ,..., n ) and determine how many digits evenly divide   (i.e.: count the number of times   divided by each digit  i  has a remainder of  ). Print the number of evenly divisible digits. Note:  Each digit is considered to be unique, so each occurrence of the same evenly divisible digit should be counted (i.e.: for  , the answer is  ). Solution--- #include<stdio.h> int main() {         int t,i,a,d,c,count,j;         scanf("%d",&t);         for(i=0;i<t;i++)         {       count=0;                 scanf("%d",&a);                 c=a;                 while(a!=0){               ...
Read more

Utopian Tree

Utopian Tree The Utopian Tree goes through  2  cycles of growth every year. Each spring, it  doubles  in height. Each summer, its height increases by  1  meter. Laura plants a Utopian Tree sapling with a height of  1  meter at the onset of spring. How tall will her tree be after   growth cycles? ----Solution-- import sys T = int(sys.stdin.readline()) for _ in range(T):     N = int(sys.stdin.readline())     height = 1              for i in range(N):         if i % 2 == 0:             height *= 2         else:             height += 1                  print(height)
Read more