Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3457. Eat Pizzas!
Given n (a multiple of 4) pizza weights, partition them into n/4 days of 4 pizzas each so that on odd days you gain the largest pizza of that day and on even days you gain the second-largest; maximize the total gained weight by choosing the grouping and day order optimally. This is a combinatorial grouping/ordering optimization problem driven by values' relative ordering.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.