LeetCode Two Sum

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is LeetCode Two Sum. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

An Oracle Health EHR workflow receives a list of integer-coded record values and a target total. Given an integer array nums and an integer target, return the indices of the two distinct elements whose values add up to target.

Use each array element at most once. You may assume that every valid input contains exactly one solution. Return the two indices in ascending order.

Formal Specification

Input: nums, a list of integers, and target, an integer.
Output: A list containing the two zero-based indices [i, j] where i < j and nums[i] + nums[j] == target.
Function: Implement two_sum(nums, target).

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Exactly one valid pair exists
The same element cannot be used twice

Function Signature

def two_sum(nums, target):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output