1402. Reducing Dishes
Video Explanation: • Reducing Dishes - Leetcode 1402 - Python
Leetcode Daily Challenge - March 29, 2023
Leetcode 1402. Reducing Dishes - Python Solution
Problem Statement
A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time.
Like-time coefficient of a dish is defined as the time taken to cook that dish including previous dishes multiplied by its satisfaction level i.e. time[i] * satisfaction[i].
Return the maximum sum of like-time coefficient that the chef can obtain after dishes preparation.
Dishes can be prepared in any order and the chef can discard some dishes to get this maximum value.
===================================================
Key Moments
0:00 Introduction to Reducing Dishes
1:55 Explanation of Reducing Dishes
3:00 Code of Reducing Dishes
4:50 Results of Reducing Dishes
===================================================
Support the channel by subscribing and hitting the like button.
Litcode Playlist: https://bit.ly/3uGBSHx
LinkedIn: / sachin-singh-ss31
Email: [email protected]
#leetcode #leetcodesolution #leetcodedailychallenge #codingpractice #learnpython #python #googleinterview #amazoninterviewpreparation