From a2c34b7467cfc49d8655d314e1b1e4ca3fe0209f Mon Sep 17 00:00:00 2001
From: Gaurav Gupta <gauravgupta662454@gmail.com>
Date: Fri, 31 Oct 2025 19:00:23 +0530
Subject: [PATCH 1/2] Create Two sum

---
 Two sum | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 Two sum

diff --git a/Two sum b/Two sum
new file mode 100644
index 0000000..9de66da
--- /dev/null
+++ b/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{};
+    }
+
+};

From 630ccd0a39af5d4c9ceb73e06afb78b105850a5e Mon Sep 17 00:00:00 2001
From: Gaurav Gupta <gauravgupta662454@gmail.com>
Date: Fri, 31 Oct 2025 19:01:47 +0530
Subject: [PATCH 2/2] Zigzag Conversion

---
 Zigzag Conversion | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 Zigzag Conversion

diff --git a/Zigzag Conversion b/Zigzag Conversion
new file mode 100644
index 0000000..b5c49b9
--- /dev/null
+++ b/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;  
+    }
+};