Leetcode 1. Two Sum

Given an array of integers and a target, return the indices of two distinct elements whose values sum to the target (exactly one valid solution exists). The core challenge is efficiently finding complementary values (aiming for better than O(n^2) brute force).