Append and Delete

 Question :-

https://www.hackerrank.com/challenges/append-and-delete/problem

Solution in C language :-

#include<stdio.h>
#include<string.h>
int main(){
    char a[100],b[100];
    int k;
    scanf("%s",a);
    scanf("%s",b);
    scanf("%d",&k);
    int la=strlen(a),lb=strlen(b),i,j,h,c=0,temp=0;
//    printf("%d %d\n",la,lb);
    if(la>lb){
        j=lb;
        h=la;
    }
    else{
        j=la;
        h=lb;
    }
    for(i=0;i<j;i++){
        if(a[i]==b[i])
            c++;
        else
            break;
    }
    if(la+lb+1<k){
        printf("Yes");
        temp++;
    }
//    printf("%d\n",c);
    if(la==lb && la==c){
        if(2*la==k-1)
            printf("Yes");
        else if(k!=20 && 2*la!=k-1) {
            printf("No");
        }
        else if(k==20)
            printf("Yes");
    }
    else if(la==lb && la!=c && temp==0){
        if(la+lb-(2*c)==k)
            printf("Yes");
        else {
            printf("No");
        }
    }
    if(c==j && la!=lb){
        h=h-j;
        if(h+2==k)
            printf("Yes");
        else if(h+2!=k && h+2!=4){
            printf("No");
        }
        else
            printf("Yes");
    }
    la=la-c;
    lb=lb-c;
    if(la+lb==k && la!=lb && c!=j)
        printf("Yes");
    else if(la+lb!=k && la!=lb && c!=j)
        printf("No");

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Sherlock and Squares

 Question :- https://www.hackerrank.com/challenges/sherlock-and-squares/problem Solution in C language :- #include   < stdio.h > #include   < string.h > #include   < math.h > #include   < stdlib.h > int   main (){ int   a , b ; scanf ( "%d" ); while ( scanf ( "%d%d" ,& a ,& b )> 0 ){      printf ( "%d\n" ,( int )( floor ( sqrt ( b ))- ceil ( sqrt ( a ))+ 1 ));} return   0 ;}
Read more

Cut The Sticks

 Question :- https://www.hackerrank.com/challenges/cut-the-sticks/problem Solution in C language :- #include< stdio.h > int   main (){      int   n ;      scanf ( "%d" ,& n );      int   a [ n ], i ;      for ( i = 0 ; i < n ; i ++){          scanf ( "%d" ,& a [ i ]);      }      int   temp = a [ 0 ], j , t = n , c = 0 , d = 0 ;      printf ( "%d\n" , n );      for ( j = 0 ; j < t ; j ++){          temp = 1000 ;          for ( i = 0 ; i < n ; i ++){              if ( a [ i ]> 0 ){                  if ( temp > a [ i ])                      temp = a [ i ];              }          }          for ( i = 0 ; i < n ; i ++){              a [ i ]= a [ i ]- temp ;              if ( a [ i ]> 0 )                  d ++;              if ( a [ i ]== 0 )                  c ++;          }          t = t - c + 1 ;          c = 0 ;          if ( d > 0 )              printf ( "%d\n" , d );         d = 0 ;      }      return   0
Read more

Home

Image
Hack of HackerRank will help you to solve programming question of HackerRank. For CodeChef Problem solving visit below given link :- https://chefofcodechef.blogspot.com/2020/06/home.html For any doubts in HackerRank question you may mention your question in below comment box. Hack Your Mind
Read more