└── Boundary traversal of matrix in Geeks For Geeks.cpp /Boundary traversal of matrix in Geeks For Geeks.cpp: -------------------------------------------------------------------------------- 1 | //Boundary traversal of matrix 2 | #include 3 | using namespace std; 4 | class Solution 5 | { 6 | public: 7 | //Function to return list of integers that form the boundary 8 | //traversal of the matrix in a clockwise manner. 9 | vector boundaryTraversal(vector > matrix, int n, int m) 10 | { 11 | vector v; 12 | if(n==1 || m==1) 13 | { 14 | for(int i=0;i=0;i--) 35 | { 36 | v.push_back(matrix[n-1][i]); 37 | } 38 | for(int i=n-2;i>=1;i--) 39 | { 40 | v.push_back(matrix[i][0]); 41 | } 42 | } 43 | return v; 44 | 45 | 46 | } 47 | }; 48 | int main() { 49 | int t; 50 | cin>>t; 51 | 52 | while(t--) 53 | { 54 | int n,m; 55 | cin>>n>>m; 56 | vector > matrix(n); 57 | 58 | for(int i=0; i>matrix[i][j]; 64 | } 65 | } 66 | 67 | Solution ob; 68 | vector result = ob.boundaryTraversal(matrix, n, m); 69 | for (int i = 0; i < result.size(); ++i) 70 | cout<