Skip to main content

TP Vis

Collision & Parallel
target

Initializing...

Speed1x
Algorithm Details
Best Time
Ω(1)
Worst Time
O(n)
Space
Θ(n)
Two Pointers
1Algorithm TwoSumSorted(arr, target):
2 left = 0, right = length - 1
3
4 While left < right:
5 sum = arr[left] + arr[right]
6 If sum == target: Return [left, right]
7 If sum < target: left++
8 Else: right--
9
10 Return []