Want my résumé? Solve one.

I solved a few hundred of these to get interviews. You only need one to get my résumé. Pick any problem, write it in JavaScript, pass every test. Fair's fair.

(there's an escape hatch at the bottom. it costs dignity.)

⏱ 0:00↻ 0 runs

Two Sum

Easy

Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

Exactly one solution exists, and you may not use the same element twice. Any order is fine.

Example 1

Input: nums = [2,7,11,15], target = 9

Output: [0,1]

// nums[0] + nums[1] == 9

Example 2

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

Output: [1,2]

•2 ≤ nums.length ≤ 10⁴
•Only one valid answer exists
•Bonus: better than O(n²)

solution.js · JavaScript

1/**
2 * @param {number[]} nums
3 * @param {number} target
4 * @return {number[]}
5 */
6function twoSum(nums, target) {
7  // your code here
8}
9

Hit Run (or ⌘/Ctrl + Enter). Your code runs in a sandbox right here in the browser.

Recruiter on a deadline? Allergic to LeetCode?