curriculum/challenges/english/blocks/daily-coding-challenges-python/6821ebe4237de8297eaee794.md
Given an array of integers representing the price of different laptops, and an integer representing your budget, return:
0 if no laptops are within your budget.get_laptop_cost([1500, 2000, 1800, 1400], 1900) should return 1800
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(get_laptop_cost([1500, 2000, 1800, 1400], 1900), 1800)`)
}})
get_laptop_cost([1500, 2000, 2000, 1800, 1400], 1900) should return 1800
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(get_laptop_cost([1500, 2000, 2000, 1800, 1400], 1900), 1800)`)
}})
get_laptop_cost([2099, 1599, 1899, 1499], 2200) should return 1899
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(get_laptop_cost([2099, 1599, 1899, 1499], 2200), 1899)`)
}})
get_laptop_cost([2099, 1599, 1899, 1499], 1000) should return 0
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(get_laptop_cost([2099, 1599, 1899, 1499], 1000), 0)`)
}})
get_laptop_cost([1200, 1500, 1600, 1800, 1400, 2000], 1450) should return 1400
({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(get_laptop_cost([1200, 1500, 1600, 1800, 1400, 2000], 1450), 1400)`)
}})
def get_laptop_cost(laptops, budget):
return laptops
def get_laptop_cost(laptops, budget):
laptops = sorted(set(laptops), reverse=True)
if len(laptops) >= 2 and budget >= laptops[1]:
return laptops[1]
if not laptops or budget < laptops[-1]:
return 0
for price in laptops[2:]:
if budget >= price:
return price
return 0