They asked 3 questions, first two were reasonable and were based on using hash tables and other data structures, and knowing their space and time complexity. one of the question was given a sorted list of integers (you must ask questions about the list and the variables it contains!!), implement an algorithm to check if there are two numbers in the list that their multiplication gives you a number X. for example: you are given a list [1,2,6,10] and X=20. what are the two number in the list that gives A*B=20? in this case 2 and 10. This must be done in O(n) (could be even better, can't recall).
