LC-0167 Medium LeetCode

167. Two Sum II - Input Array Is Sorted

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 63% Topics: Array, Two Pointers, Binary Search

Reading material

Arrays & Hashing 12 min Two Pointers 9 min Binary Search 12 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

class Solution(object):
    def twoSum(self, nums, target):
        start, end = 0, len(nums) - 1

        while start != end:
            sum = nums[start] + nums[end]
            if sum > target:
                end -= 1
            elif sum < target:
                start += 1
            else:
                return [start + 1, end + 1]

Solution from kamyu104/LeetCode-Solutions · MIT