Update Solution.py

it is easy concept i think

Author: Muneerali199

solution/0000-0099/0001.Two Sum/Solution.py

@@ -1,7 +1,6 @@
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
-        d = {}
-        for i, x in enumerate(nums):
-            if (y := target - x) in d:
-                return [d[y], i]
-            d[x] = i
+       for i in range(len(nums)):
+           for j in range(i+1,len(nums)):
+               if nums[j]==target-nums[i]:
+                   return [i,j]