← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
You have a menu of distinct dishes, each with a price, and a fixed amount of coins (budget). Your task is to list every possible combination of these dishes such that the total cost of the combination does not exceed the coin budget. Each dish may be used at most once in a combination (no repeats). The order of dishes within a combination does not matter; ["Apple", "Banana"] is the same as ["Banana", "Apple"]. Return the list of valid combinations sorted lexicographically (dictionary order) so that the output is deterministic and easy to read.