Merge pull request #2361 from jylee2033/main

[jylee2033] WEEK 01 solutions

Author: SamTheKorean

two-sum/jylee2033.py

@@ -0,0 +1,6 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        for i in range(len(nums) - 1):
+            for j in range(i + 1, len(nums)):
+                if nums[i] + nums[j] == target:
+                    return [i, j]