DP Fenwick Tree Segment Tree¶
Table of Contents¶
- 1626. Best Team With No Conflicts (Medium)
- 2407. Longest Increasing Subsequence II (Hard)
- 2770. Maximum Number of Jumps to Reach the Last Index (Medium)
- 2926. Maximum Balanced Subsequence Sum (Hard)
- 2916. Subarrays Distinct Element Sum of Squares II (Hard)
- 3410. Maximize Subarray Sum After Removing All Occurrences of One Element (Hard)
1626. Best Team With No Conflicts¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, sorting
2407. Longest Increasing Subsequence II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, divide and conquer, dynamic programming, binary indexed tree, segment tree, queue, monotonic queue
2770. Maximum Number of Jumps to Reach the Last Index¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming
2926. Maximum Balanced Subsequence Sum¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, binary search, dynamic programming, binary indexed tree, segment tree
2916. Subarrays Distinct Element Sum of Squares II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, binary indexed tree, segment tree
3410. Maximize Subarray Sum After Removing All Occurrences of One Element¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, segment tree