solved: two_sum via bruteforce, O(n^2) time, O(1) space -@iamserda

iamserda · Feb 25, 2025 · 94768a1 · 94768a1
1 parent 495819a
commit 94768a1
Showing 1 changed file with 13 additions and 0 deletions.
diff --git a/neetcodeio/algostructybeginners/Lv1-Arrays/twosum_bruteforce.py b/neetcodeio/algostructybeginners/Lv1-Arrays/twosum_bruteforce.py
@@ -0,0 +1,13 @@
+class Solution:
+    def twoSum(self, nums: list[int], target: int) -> list[int]:
+        for i in range(len(nums)):
+            for j in range(i, len(nums)):
+                if nums[i] + nums[j] == target and i != j:
+                    return [i, j]
+        return [-1, -1]
+
+
+arr = [3, 4, 5, 6]
+target = 7
+sol = Solution()
+assert sol.twoSum(arr, target) == [0, 1]