Deloitte | COGNIZANT | IBM | CAPGEMINI
def findBingoNumbers(numbers):
numbers = sorted(numbers, reverse=True)
res= None
for i in range(len(numbers)):
for j in range(i + 1, len(numbers)):
if numbers[i] + numbers[j] == 15:
pair = (min(numbers[i], numbers[j]), max(numbers[i], numbers[j]))
if res is None or pair > res:
res= pair
return f"{res[0]} {res[1]}" if res else "No Bingo Numbers"
#BingoBNumbers
#ThoughtWorks
Contact:@MLCODER2
991 ·