##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Classic hash map
Given an array of integers and an integer , return indices of the two numbers that add up to .
Each input has exactly one solution, and you can't use the same element twice. You're implementing the most famous hash map problem. It's LeetCode problem #1 for a reason. Everyone should be able to solve it in under five minutes.
