Constrained Subsequence Sum (LeetCode 1425)
HardLeetCode 1425 · Subsequences/Strings (LCS, Edit Distance) · Google, Akuna Capital · 58:50Constrained Subsequence Sum · Recursion · Memoization · Sliding Window · GOOGLE · Leetcode - 1425My 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 for LeetCode 1425 Constrained Subsequence Sum by codestorywithMIK: Dynamic Programming, Hard. Topics: Array, Dynamic Programming, Queue, Sliding Window. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
- Patterns
- Subsequences/Strings (LCS, Edit Distance)
- Asked at
- GoogleAkuna Capital
- Chapter
- Dynamic Programming
- Duration
- 58:50
Related problems
- Maximum Alternating Subsequence Sum (LeetCode 1911)
- 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)