Tuesday 19 July 2016

ZOHO INTERVIEW QUESTION rotate the matrix

#include<stdio.h>
#include<conio.h>
int N,move,n,a[100][100];
void rotate(int index){
int i,temp,temp1;
temp=a[index][index];
for(i=index+1;i<N-index;i++){
     temp1=a[index][i];
     a[index][i]=temp;
     temp=temp1;
}
for(i=index+1;i<N-index;i++){
     temp1=a[i][N-1-n];
     a[i][N-1-n]=temp;
     temp=temp1;
}
for(i=N-1-index-1;i>index;i--){
     temp1=a[N-1-n][i];
     a[N-1-n][i]=temp;
     temp=temp1;
}
for(i=N-1-index;i>index;i--){
     temp1=a[i][index];
     a[i][index]=temp;
     temp=temp1;
     printf("temp=%d",temp);
}
printf("temp=%d\n",temp);
a[index][index]=temp;
}
void main(){
int i,j,num=1;
clrscr();
scanf("%d",&N);
for(i=0;i<N;i++){
for(j=0;j<N;j++){
a[i][j]=num++;
}
}
for(i=0;i<N;i++){
for(j=0;j<N;j++) {
printf("%d ",a[i][j]);
}
printf("\n");
}

move=N/2;
n=0;
printf("move=%d\n",move);
while(move){
for(i=0;i<move;i++){
rotate(n);
}
n++;
move--;
}
for(i=0;i<N;i++){
for(j=0;j<N;j++) {
printf("%d ",a[i][j]);
}
printf("\n");
}
getch();
}


Friday 8 July 2016

print the pattern 3 4 33 34 43 44 333 334..

#include<stdio.h>
int main(){
int n,k=1,a[10000],i;
a[0]=3,a[1]=4;
scanf("%d",&n);
for(i=0;i<n;i++){
a[++k]=(a[i]*10)+3;
a[++k]=(a[i]*10)+4;
}
printf("%d",a[n-1]);
return 0;
}

Print a given matrix in spiral form

#include <stdio.h>
#define R 3
#define C 6
void spiralPrint(int m, int n, int a[R][C])
{
    int i, k = 0, l = 0;
    /*  k - starting row index
        m - ending row index
        l - starting column index
        n - ending column index
        i - iterator
    */
    while (k < m && l < n)
    {
        /* Print the first row from the remaining rows */
        for (i = l; i < n; ++i)
        {
            printf("%d ", a[k][i]);
        }
        k++;
        /* Print the last column from the remaining columns */
        for (i = k; i < m; ++i)
        {
            printf("%d ", a[i][n-1]);
        }
        n--;
        /* Print the last row from the remaining rows */
        if ( k < m)
        {
            for (i = n-1; i >= l; --i)
            {
                printf("%d ", a[m-1][i]);
            }
            m--;
        }
        /* Print the first column from the remaining columns */
        if (l < n)
        {
            for (i = m-1; i >= k; --i)
            {
                printf("%d ", a[i][l]);
            }
            l++;   
        }       
    }
}
/* Driver program to test above functions */
int main()
{
    int a[R][C] = { {1,  2,  3,  4,  5,  6},
        {7,  8,  9,  10, 11, 12},
        {13, 14, 15, 16, 17, 18}
    };
    spiralPrint(R, C, a);
    return 0;
}