The brute-force approach to solving the two-sum problem involves checking every possible pair of ... We also use a constant amount of memory to store the answer, which is an array of two integers.

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 ...