https://github.com/mbeps/two_sums
https://github.com/mbeps/two_sums
leetcode-python leetcode-solutions
Last synced: 9 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/mbeps/two_sums
- Owner: mbeps
- Created: 2023-06-07T12:49:17.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2023-06-07T12:49:20.000Z (over 2 years ago)
- Last Synced: 2025-03-15T07:54:51.055Z (9 months ago)
- Topics: leetcode-python, leetcode-solutions
- Language: Python
- Homepage:
- Size: 0 Bytes
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# **1. 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`.
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.
**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]
```
**Example 3:**
```
Input: nums = [3,3], target = 6
Output: [0,1]
```
**Constraints:**
- `2 <= nums.length <= 104`
- `-109 <= nums[i] <= 109`
- `-109 <= target <= 109`
- **Only one valid answer exists.**
**Source:** https://leetcode.com/problems/two-sum/description/