Given an array of numbers and a target sum, find two elements from the array with the target sum.
Sigiloso
First, sort it and then use 2 pointers technique. This will make time complexity O(nlogn) I also told them to improve the time complexity we could use a hashmap.