Leetcode 1402. Reducing Dishes

Given an array of integer satisfaction levels (which may be negative), choose a subset and order of dishes—each taking 1 unit time—to maximize the like-time coefficient sum, defined as sum(time_i * satisfaction_i) with time_i = 1,2,...; return the maximum achievable total.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1402. Reducing Dishes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact