Zigzag Conversion

Two sum

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        int x;
+        for(int i=0;i<nums.size();i++){
+
+            x= target-nums[i];
+
+            for(int j=i+1;j<nums.size();j++){
+
+
+                if (x==nums[j]){
+
+                    return {i,j};
+                }
+            }
+
+
+        }
+    return{};
+    }
+
+};

Zigzag Conversion

@@ -0,0 +1,28 @@
+class Solution {
+public:
+    string convert(string s, int numRows) {
+      if(numRows <= 1) return s;
+
+    vector<string>v(numRows, ""); 
+
+    int j = 0, dir = -1;
+
+    for(int i = 0; i < s.length(); i++)
+    {
+
+        if(j == numRows - 1 || j == 0) dir *= (-1); 
+
+        v[j] += s[i];
+
+        if(dir == 1) j++;
+
+        else j--;
+    }
+
+    string res;
+
+    for(auto &it : v) res += it; 
+
+    return res;  
+    }
+};