Maximum Subsequence Score - Leetcode 2542 - Python

This video talks about solving a leetcode problem which is called Maximum Subsequence Score. This question asked in many top companies.

We will see more videos on solving leetcode problems, which are asked in interviews from top companies (MAANG)

Like 👍
Share 📣
Comment 💬
Press the Bell icon🔔for updates

#python #leetcode #coding #programming

[techerror]

Hello Guys, DON'T FORGET To LIKE & Subscribe. Press the Bell icon🔔for notification :)

[brookeshieh]

It's clearly demonstration, thanks.

[bhuvaneshwarin]

Thanks for the explanation. I have a question please let me know, how you are getting these intuitions and which programming language will you choose for coding interviews.

[Karthikmut-ziye]

In case lets consider that we have heap of size k and we are adding the minimum elemnt so now heap becomes k+1 and here according to you explanation we remove the currently added element as its the minimum and we subtract from the sum multiplying with minimum value by the same index we removed the current value and as we removed the current index value from minheap we should not multiply the current index minimum value ?

[t-seriesss]

Can you please provide the study material? I will be thankful