GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Spirally traversing a matrix
Submit Your Solution :- Click Here
Solution :-
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,i,j;
cin>>t;
while(t--)
{
n=4;
int arr[5][5];
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>arr[i][j];
int start = 0;
while(start<n)
{
for(j=start;j<n;j++)
cout<<arr[start][j]<<" ";
for(j=start+1;j<n;j++)
cout<<arr[j][n-1]<<" ";
for(j=n-2;j>=start;j--)
cout<<arr[n-1][j]<<" ";
for(j=n-2;j>start;j--)
cout<<arr[j][start]<<" ";
start++;
n--;
}
cout<<endl;
}
return 0;
}
Output:-
0 Comments: