def twoSum(self, nums, target):
for i in range(0,len(nums)):
if other in nums[i+1:]:
This solution is pretty simple but it has O(n^2) complexity.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.