Sorting

Given an array of unsorted numbers nums and an integer target, find two integers in the array that sum to the target and return their indices.

There are three ways that I know of to solve this problem. Below you’ll find a description of each with some brief code examples. I would like to encourage you to try to implement your own solution first before scrolling down.

Solution 1: Brute Force

The first way, which is the brute force method, is to use nested loops. It tries every possible combination by looping over and take exponential time.