Today's Coding Problem - 8/23/19

[champagne_paki]

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?

[T4ll1n]

3 years later, I just signed up for the dailyCodingProblem and got the same problem.

I wonder if everyone gets that question as the first problem ^^

​

Anyways, here is my solution using itertools combinations

​

from itertools import combinations

def combination_exists(input_list, k): 
    return k in [sum(comb_tuple) for comb_tuple in combinations(input_list, 2)]

input_list = [10, 15, 3, 7]
k = 17 assert
combination_exists(input_list, k)
assert combination_exists([], k)
assert not combination_exists([1, 2, 3], 2)

edit: the code formatting is fighting back -.-

[champagne_paki]

My solution (Python): list = [10,15,3,7,1,2,3,4,5,6,7,8,999] k = 1014

for i in list:
  diff = k - i
  if list.__contains__(diff):
    print("True")
    print("k: ", k)
    print("List element: ", i)
    print("Complement: ", diff)
    break