PLACEMENT-C-QUESTION(ZOHO)
******************************************************************************
Save the string “WELCOMETOZOHOCORPORATION” in a two dimensional array and search for substring like “too” in the two dimensional string both from left to right and from top to bottom.
Start index : <1,2>
End index: <3, 2> *******************************************************************************/
#include<string.h>
#include<math.h>
int main()
{
char a[100],b[100][100],z[100];
int k=0,i,j,c,d;
scanf("%s %s",a,z);
c=strlen(a);
d=sqrt(c);
if((c/d)==d && c%d==0)
{
d=d;
}
else
{
d=d+1;
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
if(k>strlen(a))
{
b[i][j]='\0';
}
else
{
b[i][j]=a[k];
}
k++;
}
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
int m=j;
for(k=0;k<strlen(z);k++)
{
if(b[i][m]!=z[k])
{
break;
}
else if(b[i][m]==z[k] && k==strlen(z)-1)
{
printf("start index <%d ,%d >\n",i,j);
printf("end index <%d ,%d>",i,m);
}
m++;
}
}
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
int m=j;
for(k=0;k<strlen(z);k++)
{
if(b[m][i]!=z[k])
{
break;
}
else if(b[m][i]==z[k] && k==strlen(z)-1)
{
printf("start index <%d ,%d >\n",j,i);
printf("end index <%d ,%d>",m,i);
}
m++;
}
}
}
}
******************************************************************************
Save the string “WELCOMETOZOHOCORPORATION” in a two dimensional array and search for substring like “too” in the two dimensional string both from left to right and from top to bottom.
w e L C O M E T O Z O H O C O R P O R A T I O nAnd print the start and ending index as
Start index : <1,2>
End index: <3, 2> *******************************************************************************/
PROGRAM
#include <stdio.h>#include<string.h>
#include<math.h>
int main()
{
char a[100],b[100][100],z[100];
int k=0,i,j,c,d;
scanf("%s %s",a,z);
c=strlen(a);
d=sqrt(c);
if((c/d)==d && c%d==0)
{
d=d;
}
else
{
d=d+1;
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
if(k>strlen(a))
{
b[i][j]='\0';
}
else
{
b[i][j]=a[k];
}
k++;
}
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
int m=j;
for(k=0;k<strlen(z);k++)
{
if(b[i][m]!=z[k])
{
break;
}
else if(b[i][m]==z[k] && k==strlen(z)-1)
{
printf("start index <%d ,%d >\n",i,j);
printf("end index <%d ,%d>",i,m);
}
m++;
}
}
}
for(i=0;i<d;i++)
{
for(j=0;j<d;j++)
{
int m=j;
for(k=0;k<strlen(z);k++)
{
if(b[m][i]!=z[k])
{
break;
}
else if(b[m][i]==z[k] && k==strlen(z)-1)
{
printf("start index <%d ,%d >\n",j,i);
printf("end index <%d ,%d>",m,i);
}
m++;
}
}
}
}
Comments
Post a Comment