http://www.practice.geeksforgeeks.org/problem-page.php?

pid=1559

1.

#include <stdio.h>

//#include <conio.h>

int main() {

int a,i=0,j,x,dis=0,ans[100];

char b[100];

char ch,nextval;

//# of tests

scanf("%d\n",&a);

//enter input string

// printf("\nenter input string\n");

for(x=1;x<=a;x++)

while(ch != '\n') // terminates if user hit enter

ch = getchar();

b[i] = ch;

i++;

b[i] = '\0'; // inserting null character at end

printf("Name: %s", b);

i=i-2;
// printf("\nmax string index=%d",i);

if(b[0]=='a')

// printf("\nentered in issssssssf"); //checking

nextval='a';

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

// printf("\nentered in for");

//printf("\nb[%d]=%c",j,nextval+1);

// printf("\nnextval+1=%c",nextval+1);

if(b[j]==nextval+1)

// printf("\nentered in 1st if");

if(j>dis)

// printf("\nentered in if");

//printf("%s",b[i]);

dis=j+1;

nextval=b[j];

// printf("\nnextval=%c",nextval);

j=1;
 }

//printf("\ndistance=%d",dis);

ans[x]=dis;

else

printf("-1");

for(x=1;x<=a;x++)

printf("\n%d",ans[x]);

}
 return 0;

2.Array min sum-

#include<stdio.h>

int main()

int t,i,j,k,min=0;

//# of test cases

scanf("%d",&t);

struct testcase

int sizeOfArray;

int a[10];

int b[10];

int ans;

};

struct testcase tc[t]; //array of structures, size t

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

scanf("%d",&tc[i].sizeOfArray); //entering size of a and b

for(j=0;j<tc[i].sizeOfArray;j++) //entering elements of a

{
 scanf("%d",&(tc[i].a[j]));

for(j=0;j<tc[i].sizeOfArray;j++) //entering elements of b

scanf("%d",&tc[i].b[j]);

int no=0;

for(k=0;k<t;k++)

min= tc[k].a[0]+tc[k].b[1];

for(i=0;i<tc[k].sizeOfArray;i++)

for(j=0;(j<tc[k].sizeOfArray);j++)

{
 if((tc[k].a[i]+tc[k].b[j]<min)&&(j!=i))

min=tc[k].a[i]+tc[k].b[j];

tc[k].ans=min;

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

return 0;