2sum

2sum.java

class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap<Integer,Integer> hash = new HashMap<Integer,Integer>();
        for(int i=0; i < nums.length; i++){
            
            int searched = target - nums[i];
            if(hash.containsKey(searched)){
             
                return new int[] {hash.get(searched),i};
            
            }
            else{
              
                hash.put(nums[i],i);
            }              
            
            
        }
        throw new IllegalArgumentException("No two sum solution");
    }
}