From 39c6e10809ea430f8d600c5fdc796f983a10dd56 Mon Sep 17 00:00:00 2001
From: MitaliJain1707 <71225698+MitaliJain1707@users.noreply.github.com>
Date: Tue, 8 Dec 2020 17:29:17 +0530
Subject: [PATCH 1/3] Create mitali

---
 Team5/mitali | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 Team5/mitali

diff --git a/Team5/mitali b/Team5/mitali
new file mode 100644
index 0000000..0fcdf18
--- /dev/null
+++ b/Team5/mitali
@@ -0,0 +1 @@
+bhbh

From f923a8fba32fdde07b7664f74501cfc16e3c9621 Mon Sep 17 00:00:00 2001
From: MitaliJain1707 <71225698+MitaliJain1707@users.noreply.github.com>
Date: Tue, 8 Dec 2020 17:33:27 +0530
Subject: [PATCH 2/3] Delete mitali

---
 Team5/mitali | 1 -
 1 file changed, 1 deletion(-)
 delete mode 100644 Team5/mitali

diff --git a/Team5/mitali b/Team5/mitali
deleted file mode 100644
index 0fcdf18..0000000
--- a/Team5/mitali
+++ /dev/null
@@ -1 +0,0 @@
-bhbh

From 041c73ba171112cbe892ac749583ab56e628327a Mon Sep 17 00:00:00 2001
From: MitaliJain1707 <71225698+MitaliJain1707@users.noreply.github.com>
Date: Tue, 8 Dec 2020 21:56:11 +0530
Subject: [PATCH 3/3] week 1

---
 Team5/Mitali/spiral print | 44 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Team5/Mitali/spiral print

diff --git a/Team5/Mitali/spiral print b/Team5/Mitali/spiral print
new file mode 100644
index 0000000..10824e5
--- /dev/null
+++ b/Team5/Mitali/spiral print	
@@ -0,0 +1,44 @@
+class Solution {
+public:
+    vector<int> spiralOrder(vector<vector<int>>& matrix) {
+        int m=matrix.size();
+        if(m==0){
+            return vector<int>();
+        }
+        vector<int>j =matrix[0];
+        int n=j.size();
+        int startrow=0;
+        int endrow=m-1;
+        int startcol=0;
+        int endcol=n-1;
+        vector<int> output(m*n,0);
+        int k=0;
+        while(startrow<=endrow && startcol<=endcol){
+                for(int i=startcol;i<=endcol;i++){
+                    output[k]=matrix[startrow][i];
+                    k++;
+                }
+             startrow++;
+            for(int l=startrow;l<=endrow;l++){
+                output[k]=matrix[l][endcol];
+                 k++;
+            }
+            endcol--;
+            if(endrow>=startrow){
+                for(int i=endcol;i>=startcol;i--){
+                    output[k]=matrix[endrow][i];
+                    k++;
+                }
+                endrow--;
+            }
+            if(startcol<=endcol){
+                for(int l=endrow;l>=startrow;l--){
+                    output[k]=matrix[l][startcol];
+                    k++;
+                }
+                startcol++;
+            }
+         }
+        return output;
+    }
+};