# LeetCode 0001 - Two Sum

## Contents

# Two Sum

## Desicription

Given an array of **integers**, return indices of the two numbers such that they add up to a specific target.

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

**Example:**

1 | Given nums = [2, 7, 11, 15], target = 9, |

## Solution

1 | class Solution{ |