LeetCode Easy in 30 Minutes | Dataford Interview Questions

Solve a LeetCode easy problem in no more than 30 minutes.

Implement two_sum(nums, target) to return the indices of two distinct elements whose values add up to target. Return the indices in any order. Each input has exactly one valid solution.

Input: an integer list nums and integer target. Output: a list containing the two zero-based indices.

Constraints: 2 <= len(nums) <= 10^4; values and target are between -10^9 and 10^9.

Constraints

2 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Each input has exactly one valid solution
The same element cannot be used twice

Function Signature

def two_sum(nums, target):

Your question is LeetCode Easy in 30 Minutes. Start with the requirements in the Question tab.

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

Problem