Maximum Subsequence Score | Leetcode Q.2542 | Python | C++ | Java | LeetCode Daily Challenges

Hi everyone, in this video we are going to solve the Maximum Subsequence Score problem. It is a medium-level problem and is based on sorting techniques and heap data structure.

We will cover the following points in this video,
1. Firstly we will understand the problem with the help of examples.
2. After having a clear idea of the problem statement, we will jump to the logic part.
3. In the logic part, we will understand the logic with the help of examples.
4. After understanding the logic of the problem, we will move to the implementation part.
5. In the implementation part, we will implement our logic in Python, C++, and Java programming languages.

chapter:
0:00 Introduction
0:20 Understanding the problem
4:54 Logic
12:42 Python Implementation
15:40 C++ Implementation
19:12 Java Implementation