Two Sum | Leetcode # 1 | Easy

In this post I will discuss the solution to the leetcode problem — Two Sum.


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

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: