資料結構

Given an array of integers and a target value, return the indices of the two numbers that add up to the target. What type of data structures allows to deduce a brute-force $O(n^2)$ solution down to $O(n)$ time complexity.