Jumping on the Clouds: Revisited Hacker Rank Solution in C

 #include<stdio.h>

int main()

{

    int n,k;

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

    int c[n],ans=100;

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

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

    if(c[0] == 1)

        ans=ans-3;

    else 

        ans=ans-1;

    for(int i=k;i!=0;i=(i+k)%n)

    {

        if(i%n == 0)

            break;

        if(c[i%n] == 1)

            ans=ans-3;

        else

            ans=ans-1;

    }

    printf("%d",ans);

}

Sequence Equation Hacker Rank Solution in C

 here 5 is occurring at index 1 and index 1 is occurring as element at index 3

#include<stdio.h>

int main()

{

    int n;

    scanf("%d",&n);

    int a[n+1],h[51];

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

    {

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

        h[a[i]]=i;

    }

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

        printf("%d\n",h[h[i]]);

}

Save the Prisoner! Hacker Rank Solution in C

 #include<stdio.h>

int main()

{

    int t;

    scanf("%d",&t);

    while(t--)

    {

        int n,m,s;

        scanf("%d%d%d",&n,&m,&s);

        int ans=(s+m-1)%n;

        if(ans == 0)

            printf("%d\n",n);

        else

            printf("%d\n",ans);

    }

}

Viral Advertising Hacker Rank solution in C

 #include<stdio.h>

#include<math.h>

int main()

{

    int n;

    scanf("%d",&n);

    int liked=2,ans=2,shared;

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

    {

        shared = liked *3;

        liked = floor(shared/2.0);

        ans=ans+liked;

    }

    printf("%d",ans);

}

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");

    }

}