some more neetcode

1-two-sum/driver.cpp

@@ -0,0 +1,11 @@
+#include "soln.hpp"
+
+int main()
+{
+	vector<int> nums{2, 7, 11, 15};
+	int target = 9;
+	vector<int> answer{0, 1};
+	Solution soln;
+	cout << "Found two-sum indices correctly? " << soln.test(nums, target, answer) << endl;
+	return 0;
+}

1-two-sum/soln.cpp

@@ -0,0 +1,24 @@
+#include "soln.hpp"
+
+vector<int> Solution::twoSum(vector<int> &nums, int target)
+{
+	vector<int> result(2);
+	for (int i = 0; i < nums.size(); i++)
+	{
+		for (int j = i + 1; j < nums.size(); j++)
+		{
+			if (nums[i] + nums[j] == target)
+			{
+				result[0] = i;
+				result[1] = j;
+				return result;
+			}
+		}
+	}
+	return result;
+}
+
+bool Solution::test(vector<int> &nums, int target, vector<int> &answer)
+{
+	return twoSum(nums, target) == answer;
+}

1-two-sum/soln.hpp

@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+using namespace std;
+class Solution
+{
+public:
+	vector<int> twoSum(vector<int> &nums, int target);
+	bool test(vector<int> &nums, int target, vector<int> &answer);
+};