Leetcode 2993. Friday Purchases I

Given a list of item prices and a budget, determine the maximum number of purchases you can make across successive Fridays under a repeating weekly pricing/selection pattern. The task reduces to selecting an optimal subset/order of prices under a budget constraint and is typically solved with sorting, prefix sums and greedy/binary-search feasibility checks.