Two Sum

easyLeetCodeJS / TS7 tests

Problem Statement

Given an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`. You may assume that each input would have exactly one solution, and you may not use the same element twice.

Examples

Example 1:
Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:
Input: nums = [3,2,4], target = 6
Output: [1,2]

JavaScript & TypeScript starter code included

Run this as a live interview

Practice solo

7 test cases. No second person needed.

Two Sum

Problem Statement

Examples

Practice solo

Get new interview exercises