Showing posts with label arrays. Show all posts
Showing posts with label arrays. Show all posts

Thursday, 3 September 2020

Cheapest Subarray hacker earth solution in C

https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/cheapest-subarray-d628cb65/submissions/?utm_source=header&utm_medium=search&utm_campaign=he-search 


#include<stdio.h>

void main ()
{
    int t;
    scanf("%d",&t);
    while (t--)
    {
        int n;
        scanf("%d",&n);
        int a[n],i=0;
        scanf("%d",&a[i]);
        for (i=1;i<n;i++)
        {
            
            scanf("%d",&a[i]);
            a[i-1]= a[i-1] + a[i];
            
        }
        int min = a[0];
        for (i=1;i<n-1;i++)
            if (min>a[i])
                min = a[i];
        
        printf("%d\n",min);
    }
}

Palindromic Numbers Hacker Earth Solution in C

 https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/palindromic-numbers-7/submissions/?utm_source=header&utm_medium=search&utm_campaign=he-search


int ispallin(int n)
{
int ar[10],c = 0;
    for(;n!=0;n=n/10)
        ar[c++] = n%10;

    for(int i =0, j= c-1; i<j; i++,j--)
        if(ar[i]!=ar[j])
            return 0;
    return 1;
}
int main()
{
int t;
    scanf("%d",&t);
while(t--)
    {
    int a,b;
    scanf("%d%d",&a,&b);
    int ans = 0,c=0;;
    for(int i=a;i<=b;i++)
             if(ispallin(i))
                 c++;
    printf("%d\n",c);
}
return 0;
}

Sunday, 30 August 2020

Min Max Hacker Earth solution in C

 https://www.hackerearth.com/practice/basic-programming/implementation/basics-of-implementation/practice-problems/algorithm/min-max-3/submissions/


#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int a[n],i,max,min,h[1001]={0},flag=0;
    scanf("%d",&a[0]);
    max=min=a[0];
    h[a[0]]++;
    for(i=1;i<n;i++)
    {
        scanf("%d",&a[i]);
        h[a[i]]++;
        if(max < a[i])
            max=a[i];
        if(min > a[i])
            min=a[i];
    }
for(i=min;i<=max;i++)
        if(h[i] == 0)
        {
            flag=1;
            break;
        }
    if(flag == 1)
        printf("NO");
    else
        printf("YES");
}