Problem 1 · Easy
Find two indices that add to the target using a single-pass hash map to achieve O(n) time.
Open the interactive visualisation