diff --git a/LeetCode Questions/C++/1. Problems/zigzag_Conversion.cpp b/LeetCode Questions/C++/1. Problems/zigzag_Conversion.cpp
new file mode 100644
index 00000000..89ac17d3
--- /dev/null
+++ b/LeetCode Questions/C++/1. Problems/zigzag_Conversion.cpp	
@@ -0,0 +1,18 @@
+class Solution {
+public:
+    string convert(string s, int numRows) {
+        string ans;
+        vector <string> tmp(numRows);                                                         
+        //create strings for each row
+        int i=0, n=s.size();
+        while(i<n){                                      
+            for(int j=0;j<numRows && i<n; j++, i++) tmp[j] += s[i];              
+            //add for our strings character when we move down
+            for(int j=numRows - 2;j>0 && i<n; j--, i++) tmp[j] += s[i];
+            //add for our strings character when we move up exept first and last string
+        }
+        for(int j=0;j<numRows; j++) ans += tmp[j];                    
+        //combain together our strings
+        return ans;
+    }
+};
\ No newline at end of file