Two sum
Given an array of integers and a target, return the indices of the two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.
Implement
two_sum(nums: list[int], target: int) → list[int]Examples
in
[[2,7,11,15],9]out[0,1]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
[[2,7,11,15],9][0,1]not run yetsample