Package matcher
Description
As the owner of an online store, you need to fulfill orders everyday. To optimize the packing of each order, you decide to write an algorithm to match boxes and items based on their respective sizes.
You have access to the following two boxes:
- A medium box (identifier: M)
- A large box (identifier: L)
When possible, you should try to fit multiple items in the same box but boxes can only contain one type of product.
This is the list of items you sell along with associated boxes:
- Camera (identifier: Cam): one can fit in a medium box, and up to two can fit in a large box
- Gaming Console (identifier: Game): too big for a medium box, but up to two can fit in a large box
- max of 2 g consoles can fit in 1 box
- Bluetooth speaker (identifier: Blue): one can fit in a large box . max is 1 per large box
Your goal is to design a function that takes a list of items and returns the box & item matches (examples below).
Your solution should work for any number of each item greater than or equal to zero.
Input = [], Output = []
## Input/Output expectations
["Cam"] -> [M: ["Cam"]]
["Cam", "Game"] -> [M: ["Cam"], L: ["Game"]]
["Game", "Blue"] -> [L: ["Game"], L : ["Blue"]]
["Game", "Game", "Blue"] -> [L: ["Game", "Game"], L : ["Blue"]]
["Cam", "Cam", "Game", "Game"] -> [L: ["Cam", "Cam"], L: ["Game", "Game"]]
["Cam", "Cam", "Cam", "Game", "Game", "Game", "Cam", "Blue"] ->
[L: ["Cam", "Cam"], L: ["Cam", "Cam"], L: ["Game", "Game"], L: ["Game"], L: ["Blue"]]
["Cam", "Cam", "Cam", "Game", "Game", "Cam", "Cam", "Blue", "Blue"] -> [L: ["Cam", "Cam"] , L: ["Cam", "Cam"] , M: ["Cam"] , L: ["Game", "Game"] , L: ["Blue"] , L: ["Blue"]]
def packaging(items):
""":items: List of items ["Game", "Game", "Blue"]
"""
max_map = {
"M": {
"Cam": 1
},
"L": {
"Cam": 2,
"Game": 2,
"Blue": 1
}
}
item_map = {}
for item in items:
if item in item_map:
item_map[item] += 1
else:
item_map[item] = 1
output = []
print(item_map)
for item in item_map:
num = item_map[item]
l_box = []
if item == "Cam":
m_box = []
while num > 0:
#first put in L
print(num)
while num >= max_map['L']['Cam']:
print('{} {}'.format(num, l_box))
if len(l_box) == max_map['L']['Cam']:
output.append('L: {}'.format(l_box))
l_box = []
else:
l_box.append(item)
num -= 1
if 0 < len(l_box) <2:
if num > 0:
l_box.append(item)
num -= 1
output.append('L: {}'.format(l_box))
else:
output.append('L: {}'.format(l_box))
# put remainder in M boxes
if num > 0:
output.append('M: {}'.format([item]))
num -= 1
else:
while num > 0:
print(num)
if len(l_box) >= max_map['L'][item]:
output.append('L: {}'.format(l_box))
l_box = []
else:
l_box.append(item)
num -= 1
if len(l_box) > 0:
output.append('L: {}'.format(l_box))
return outputIs this HArd, medium or easy problem?
Comments (22)