find_numbers.py

class Solution:
    def findTwoNumbers(self, nums, target):
        """
        - array is sorted
        - nums[l] + nums[r]
            - more than target, move r pointer backwards
            - less than target, move l pointer forward
            - if equal to target, append to result array
        """

        if not nums:
            return []

        l, r = 0, len(nums) - 1

        while l < r:
            total = nums[l] + nums[r]
            if total < target:
                l += 1
            elif total > target:
                r -= 1
            else:
                return [l, r]

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


if __name__ == "__main__":
    solution = Solution()

    nums = [1, 2, 3, 4, 6]
    target = 6
    result = solution.findTwoNumbers(nums, target)
    assert result == [1, 3]
    print(result)
    print("Test Case Passed!")