Classic Coding Challenge | Dataford Interview Questions

Implement a solution for a standard problem like Two Sum or basic sorting algorithms.

For this task, implement two_sum(nums, target). Return the indices of two distinct elements whose values add up to target. Assume exactly one valid pair exists, and return the indices in ascending order.

Input is an integer list and an integer target. Output is a two-element list of integers.

Constraints

2 <= nums.length <= 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 question is Classic Coding Challenge. 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

Implement a solution for a standard problem like Two Sum or basic sorting algorithms.

Input is an integer list and an integer target. Output is a two-element list of integers.

Constraints

2 <= nums.length <= 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 question is Classic Coding Challenge. 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.