Picking Numbers Hacker Rank Solution in C

 https://www.hackerrank.com/challenges/picking-numbers/problem

#include<stdio.h>

int main()

{

    int n;

    scanf("%d",&n);

    int a[n],h[100]={0},i;

    for(i=0;i<n;i++)

    {

        scanf("%d",&a[i]);

        h[a[i]]++;

    }

    long long int max=0;

    for(i=0;i<100;i++)

    {   

        if(h[i] > 0 && i<99 && h[i+1] > 0)

        {

            if(max < h[i]+h[i+1])

                max=h[i]+h[i+1];

        }   

        else if(h[i] > 0)

        {

             if(max < h[i])

                max=h[i];

        }

    }

    printf("%d",max);

}     

    

Cats and a Mouse Hacker Rank Solution in C

https://www.hackerrank.com/challenges/cats-and-a-mouse/problem

#include<stdio.h>

#include<math.h>

int main()

{

    int q;

    scanf("%d",&q);

    while(q--)

    {

        int x,y,z;

        scanf("%d%d%d",&x,&y,&z);

        if(abs(x-z) < abs(y-z) )

            printf("Cat A\n");

        else if(abs(x-z) > abs(y-z))

            printf("Cat B\n");

        else

            printf("Mouse C\n");

    }

}

The Hurdle Race Hacker Rank Solution in C

https://www.hackerrank.com/challenges/the-hurdle-race/problem 

#include<stdio.h>

int main()

{

    int n,k;

    scanf("%d%d",&n,&k);

    int height[n],max=0;

    for(int i=0;i<n;i++)

    {

        scanf("%d",&height[i]);

        if(max<height[i])

            max=height[i];

    }

    if(max-k > 0)

        printf("%d",max-k);

    else 

        printf("0");

}

Designer PDF Viewer Hacker Rank Solution in C

https://www.hackerrank.com/challenges/designer-pdf-viewer/problem 

#include <stdio.h>

#include<string.h>

int main()

{

    char word[1000];

    int h[26];

    for(int i = 0; i < 26; i++)

       scanf("%d",&h[i]);

    scanf("%s",word);

    int max = 0;

    int len = strlen(word);

    for(int i = 0; i < len; i++) 

        if(h[word[i] - 'a'] > max) 

            max = h[word[i] - 'a'];

    

    printf("%d", max * len);

    return 0;

}

Beautiful Days at the Movies Hacker Rank Solution in C

https://www.hackerrank.com/challenges/beautiful-days-at-the-movies/problem 

#include<stdio.h>

int main()

{

int i,j,k,n,r,rev,count=0;

scanf("%d%d%d",&i,&j,&k);

for(;i<=j;i++)

{

    n=i;

    rev=0;

    while(n > 0)

    {

        r=n%10;

        rev=(rev*10)+r;

        n=n/10;

    }

    if(abs(i-rev)%k==0)

        count=count+1;

}

printf("%d",count);

return 0;

}

Drawing Book Hacker Rank Solution in C

#include<stdio.h>

int main()

{

    int n,p;

    scanf("%d%d",&n,&p);

    if( p/2 <n/2-p/2)

        printf("%d",p/2);

    else

        printf("%d",n/2-p/2);

}