Two Sum: Given an array of integers, find two numbers such that they add up to a specific target number

TwoSum.java

import java.util.Map;
import java.util.HashMap;
import java.util.Map;
import java.util.HashSet;

public class TwoSum {
 
    public static Set<Integer, Integer> twoSum(int targetSum, int input[]) {
        Map<Integer, Integer> map = new HashMap<>();
        Set<Integer, Integer> results = new HashSet<>();

        for(int i=0; i< input.length; i++){
            if(map.containsKey(input[i])) {
                results.add(input[i], targetSum-input[i]);
            }
            else {
                map.put(sum-input[i],i);
            }
        }
    }
    
    public static void main(String args[]){
        
    }
    
}