Locked

Pass the Dictionary check first

Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.

Still to clear · 8 of 8

Continue the check

Preview · where this ladder is heading

Capstone: Two Sum

Given a list of integers nums and an integer target, return the indexes [i, j] (with i < j) of the two numbers that add up to target. Exactly one such pair exists, and you may not use the same position twice.

Aim for one pass.

innums = [2, 7, 11, 15], target = 9out[0, 1]
innums = [3, 2, 4], target = 6out[1, 2]
innums = [3, 3], target = 6out[0, 1]

You can read it now. The editor opens when the check is cleared.