Maximum Alternating Subsequence Sum (LeetCode 1911) – Part 2
MediumLeetCode 1911 · Subsequences/Strings (LCS, Edit Distance) · Google, Meta · 25:58Maximum Alternating Subsequence Sum · BOTTOM UP · INTUITION · DP Concepts & Qns - 10 · Leetcode-1911My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution (part 2 of 2) for LeetCode 1911 Maximum Alternating Subsequence Sum by codestorywithMIK: Dynamic Programming, Medium. Topics: Array, Dynamic Programming. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Dynamic Programming
- Patterns
- Subsequences/Strings (LCS, Edit Distance)
- Chapter
- Dynamic Programming
- Duration
- 25:58
Related problems
- Longest Increasing Subsequence (LeetCode 300)
- Maximum Balanced Subsequence Sum (LeetCode 2926)
- Print Longest Common Subsequence
- Shortest Common Supersequence
- Print Shortest Common Supersequence (LeetCode 1092)
- Edit Distance (LeetCode 72)
- Palindromic Substrings (LeetCode 647)
- Longest Palindromic Substring (LeetCode 5)