Two Sum — LeetCode #1 (Easy)

TL;DR Single-pass hash map lookup: store each number's index as you go, check for the complement before storing. O(n) time, O(n) space. The Problem Given an array of integers nums and an integer targe