#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/data-structures/arrays-prefix-sums/two-sum-sorted-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/data-structures/arrays-prefix-sums/two-sum-sorted-implementation

Repovive

Two Sum Sorted - Implementation - Arrays & Prefix Sums | Data Structures | Repovive

Repovive.

Data Structures19 sections · 729 units49h total

Open in Course

Two Sum Sorted - Implementation

Clean solution

Here's the solution:

function twoSum(numbers, target)
    left := 0
    right := length of numbers - 1

    while left < right
        sum := numbers[left] + numbers[right]
        if sum = target
            return [left + 1, right + 1]  // 1-indexed
        else if sum < target
            left := left + 1
        else
            right := right - 1

    return []  // no solution found

Time: $O(n)$ . Space: $O(1)$ .