DP Other Optimized¶
Table of Contents¶
- 1937. Maximum Number of Points with Cost (Medium)
- 2713. Maximum Strictly Increasing Cells in a Matrix (Hard)
- 3181. Maximum Total Reward Using Operations II (Hard)
- 2267. Check if There Is a Valid Parentheses String Path (Hard)
- 3213. Construct String with Minimum Cost (Hard)
- 3292. Minimum Number of Valid Strings to Form Target II (Hard)
- 2263. Make Array Non-decreasing or Non-increasing (Hard) 👑
1937. Maximum Number of Points with Cost¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, matrix
2713. Maximum Strictly Increasing Cells in a Matrix¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, binary search, dynamic programming, memoization, sorting, matrix, ordered set
3181. Maximum Total Reward Using Operations II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation
2267. Check if There Is a Valid Parentheses String Path¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, matrix
3213. Construct String with Minimum Cost¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, string, dynamic programming, suffix array
3292. Minimum Number of Valid Strings to Form Target II¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, string, binary search, dynamic programming, segment tree, rolling hash, string matching, hash function
2263. Make Array Non-decreasing or Non-increasing¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, greedy