Given a list of integers nums and a target integer target, return the indices of the two numbers that add up to target.
Return the indices as a list [i, j] where i < j. You may assume exactly one solution exists.
This is the classic entry-level interview problem. It shows up in payment processing (finding matching transactions), logistics (finding pairs that fill a weight limit), and more.