← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
You are given a list of menu items, each with a name and a price, and an integer coin budget. Your task is to return every possible combination of these items whose total cost is less than or equal to the budget. Each combination must be non-empty, and the order of item names inside a combination must be lexicographic. The list of combinations itself must also be returned in lexicographic order.