Hash Map O(1) Lookups

Classic Two Sum Problem Value-to-Index Mapping Store values as keys and their indices as values. This pattern solves many "find where" problems. The ordering of operations inside a loop matters enormously. Checking before storing ensures you only match pairs of distinct elements, not a single element matched against itself.