https://github.com/raj-roy/leetcode-two-sum
https://github.com/raj-roy/leetcode-two-sum
csharp leetcode solutions
Last synced: 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/raj-roy/leetcode-two-sum
- Owner: raj-roy
- License: mit
- Created: 2024-11-01T06:21:51.000Z (about 1 year ago)
- Default Branch: dev
- Last Pushed: 2024-11-07T04:44:44.000Z (about 1 year ago)
- Last Synced: 2025-08-05T09:14:02.794Z (5 months ago)
- Topics: csharp, leetcode, solutions
- Language: C#
- Homepage:
- Size: 8.79 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Two Sum
## Porblem 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.
You can return the answer in any order.
## Explanation
**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.