add initial project files including .gitignore, editor settings, and Two Sum implementation

Easy/TwoSum/TwoSum.cpp

@@ -0,0 +1,20 @@
+//
+// Created by bob on 12/04/2026.
+//
+
+#include "TwoSum.h"
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        for (int j = 0; j < nums.size(); j++)
+        {
+            for (int i = 1; i < nums.size(); i++)
+            {
+                if (nums[j]+nums[i] == target)
+                { return {i, j}; }
+            }
+        }
+        return {};
+    }
+};

Easy/TwoSum/TwoSum.h

@@ -0,0 +1,16 @@
+//
+// Created by bob on 12/04/2026.
+//
+
+#ifndef LEET_CODE_PROG_TWOSUM_H
+#define LEET_CODE_PROG_TWOSUM_H
+
+
+
+class TwoSum {
+
+};
+
+
+
+#endif //LEET_CODE_PROG_TWOSUM_H

Easy/TwoSum/TwoSum.md

@@ -0,0 +1,39 @@
+# 1. Two Sum
+### Easy
+
+Hint
+Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+You can return the answer in any order.
+
+
+
+#### Example 1:
+
+Input: nums = `[2,7,11,15], target = 9`
+
+Output: `[0,1]`
+
+Explanation: Because `nums[0] + nums[1] == 9`, we return `[0, 1]`.
+
+#### Example 2:
+
+Input: nums = [3,2,4], target = 6
+Output: [1,2]
+Example 3:
+
+Input: nums = [3,3], target = 6
+Output: [0,1]
+
+
+### Constraints:
+
+`2 <= nums.length <= 104`
+
+`-109 <= nums[i] <= 109`
+
+`-109 <= target <= 109`
+
+Only one valid answer exists.