Write an algorithm that tells me if 2 and only two numbers in a 1x3 array are the same.

Question

Sigiloso · Accepted Answer

llist.sort()
my_new_list = list(set(llist))

my_dict = dict((my_new_list[i],llist.count(my_new_list[i])) for i in range(len(my_new_list)))

for key,val in sorted(my_dict.items()):
  if val == 2:
    print key

Renski · Answer

In ruby:

def find_it(arr)
	a = Hash.new(0)
	arr.each do |b|
	  a[b] += 1
  end
  
  a.each do |k, v|
    return true if v == 2 
  end
  
  return false
end

That will find two and only two matches in an arbitrarily long array.  For extra credit, how can you optimize it for an array of only 3 elements?

MongoDB

Pergunta de entrevista da empresa MongoDB

Respostas da entrevista

Empresas seguidas

Buscas de vagas