LeetCode Problem #1 - Solved with MinangScript
Hash Map Approach: We iterate through the array once, and for each element, we check if the complement (target - current) exists in our hash map. If it does, we found our answer. If not, we add the current element to the hash map.