class Solution {
public:
    vector<int> findNumbersWithSum(vector<int>& nums, int target) {
        unordered_set<int> st;
        for(int i = 0; i < nums.size(); i ++ ){
            if(st.count(target - nums[i]))  return {nums[i], target - nums[i]};
            st.insert(nums[i]);
        }
    }
};