https://github.com/lucas-erkana/codingchallenge-two-sum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
https://github.com/lucas-erkana/codingchallenge-two-sum

Last synced: 5 days ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/lucas-erkana/codingchallenge-two-sum
• Owner: Lucas-Erkana
• Created: 2023-10-31T07:58:35.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-10-31T08:08:09.000Z (about 1 year ago)
• Last Synced: 2024-10-12T09:49:16.038Z (about 1 month ago)
• Language: JavaScript
• Size: 12.7 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Two Sum 

[Leecode](https://leetcode.com/problems/two-sum/description/)

## Problem Description

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

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

## Examples

**Example 1:**

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

Output: `[0,1]`

Explanation: Because `nums[0] + nums[1]` equals `9`, we return `[0, 1]`.

**Example 2:**

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

Output: `[1,2]`

**Example 3:**

Input: `nums = [3,3]`, `target = 6`

Output: `[0,1]`

## Constraints

- `2 <= nums.length <= 10^4`

- `-10^9 <= nums[i] <= 10^9`

- `-10^9 <= target <= 10^9`

- Only one valid answer exists.