Sherlock and Valid String | Editorial by aksingh007

Calculate the frequency of each character and find the minimum frequency. Now, subtract the minimum frequency from frequency of each 
character, add them and store. If the sum is less than equal to 1, print 'YES' else print 'NO'

```
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
  char str[100003];
    int arr[150]={0},i,min=9999999,sum=0,flag=0,count=1;
    scanf("%s",str);
    char*p=str;
    while(*p!='\0'){
        arr[(int)*p]++;
        p++;
    }
    for(i=97;i<=122;i++){
        if(arr[i]<min && arr[i]!=0)
            min=arr[i];
    }
    for(i=97;i<=122;i++){
        if(arr[i]!=0){
           // printf("%d %d %d\n",arr[i],i,min);
        sum+=arr[i]-min;
    }
    }
    for(i=98;i<=122;i++){
        if(arr[i]!=arr[i-1] && arr[i]!=0)
            count++;
        if(arr[i]==1)
            flag++;
    }
   // printf("%d %d\n",sum,min);
    
    if(count==2 && flag==1 ){
         printf("YES\n");
        return 0;
    }
    if(sum==1 || sum==0)
        printf("YES\n");
    else
        printf("NO\n");
    
     return 0;   
}

```

Sherlock and Valid String | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?