This problem was recently asked by Google. Given a list of numbers and a number k, return whether any two numbers from the list add up to k. For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17. Bonus: Can you do this in one pass? 1. If the number of elements in the given list is small, I can use Brute Force Algorithm. Time complexity would be O(N^2) 리스트에 들어있는 원소의 사이즈가 작..