diff --git a/diagonalTraverse.cpp b/diagonalTraverse.cpp
new file mode 100644
index 00000000..846cf430
--- /dev/null
+++ b/diagonalTraverse.cpp
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    vector<int> findDiagonalOrder(vector<vector<int>>& mat) {
+        vector<int> answer;
+        map<int, vector<int>> um;
+
+        for (int i=0;i<mat.size();i++) {
+            for (int j=0;j<mat[0].size();j++) {
+                um[(i+j)].push_back(mat[i][j]);
+            }
+        }
+        int dir = 0;
+        for (auto itr: um) {
+            if (dir%2 == 0) 
+                reverse(itr.second.begin(), itr.second.end());
+            for (auto x: itr.second) {
+                answer.push_back(x);
+            }
+            dir++;
+        }
+
+        return answer;
+    }
+};
diff --git a/productOfArrayExceptSelf.cpp b/productOfArrayExceptSelf.cpp
new file mode 100644
index 00000000..913e1cfe
--- /dev/null
+++ b/productOfArrayExceptSelf.cpp
@@ -0,0 +1,22 @@
+class Solution {
+public:
+    vector<int> productExceptSelf(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> left(n,1), right(n, 1), answer(n, 1);
+
+        left[0] = 1;
+        for (int i=1;i<n;i++) {
+            left[i] = left[i-1]*nums[i-1];
+        }
+
+        right[n-1]=1;
+        for (int j=n-2;j>=0;j--) {
+            right[j] = right[j+1]*nums[j+1];
+        }
+
+        for (int i=0;i<n;i++)
+            answer[i] = left[i]*right[i];
+
+        return answer;
+    }
+};