Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1402. Reducing Dishes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source