twoSum #leetcode1
#Problem Statement
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

### Solution Approach
1. Initialize a Hash Map: Create an unordered map to store the numbers and their indices.
2. Iterate through the Array: Loop through each element in the array.
3. Check for Complement: For each element, calculate the complement (target - current element).
4. Find in Hash Map: Check if the complement exists in the hash map.
- If it does, return the indices.
- If it doesn't, store the current element and its index in the hash map.
5. Return Indices: Once the complement is found, the solution is returned.