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 | 力扣

• Tags: Array, Dynamic Programming, Matrix

2713. Maximum Strictly Increasing Cells in a Matrix

• LeetCode | 力扣

• Tags: Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set

3181. Maximum Total Reward Using Operations II

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Bit Manipulation

2267. Check if There Is a Valid Parentheses String Path

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Matrix

3213. Construct String with Minimum Cost

• LeetCode | 力扣

• Tags: Array, String, Dynamic Programming, Suffix Array

3292. Minimum Number of Valid Strings to Form Target II

• LeetCode | 力扣

• Tags: Array, String, Binary Search, Dynamic Programming, Segment Tree, Rolling Hash, String Matching, Hash Function

2263. Make Array Non-decreasing or Non-increasing 👑

• LeetCode | 力扣

• Tags: Dynamic Programming, Greedy