Great explanation. Thank you. Are you familiar with any algorithms for solving the following task: lets say we have an empty battery with infinite capacity that is beeing charged at W Watts/Hour, and B number of buttons, each button uses X amount of stored energy, but increases the charging rate by Y Watts/Hour. Each button can be pressed only once. We need to find the sequence that will allow us to reach the maximum charging rate (aka press all the buttons) in the shortest time.
Such clear explanation and visual drawings are the reason why u r ny go to person for DSA , you are #1 man
thanks :)
Really Informative.
nice :)
Great explanation. Thank you. Are you familiar with any algorithms for solving the following task: lets say we have an empty battery with infinite capacity that is beeing charged at W Watts/Hour, and B number of buttons, each button uses X amount of stored energy, but increases the charging rate by Y Watts/Hour. Each button can be pressed only once. We need to find the sequence that will allow us to reach the maximum charging rate (aka press all the buttons) in the shortest time.
This is great
Nice
Very Well explained in depth🔥🫡
Now I will not forget this, thanks
great