Time: 1796 ms (14%), Space: 18.3 MB (87.05%) - LeetHub

Author: sozerodev

0001-two-sum/0001-two-sum.py

@@ -0,0 +1,18 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+
+        target1, target2 = None, None
+        for i in range(len(nums)):
+            for j in range(i+1, len(nums)):
+
+                if nums[i] + nums[j] == target:
+                    return [i,j]
+
+
+
+            
+
+
+#0 1 2 3 4 
+
+