Skip to main content
Two Sum | AlgoCracked
AlgoCracked
ProblemsTwo Sum
Easy51.0% acceptance
Blind75ArrayHash Table

Two Sum

Given an array of integers nums and an integer target , return the indices of the two numbers that add up to target . Exactly one such pair exists, and you may not use the same element twice. Return the two indices in increasing order . Input format Input is [nums, target] , e.g. [[2,7,11,15],9] .

Loading workspace…