0300 | Longest Increasing Subsequence | [[LeetCode XXXX]] | Array, Binary Search, Dynamic Programming | Medium |
0673 | Number of Longest Increasing Subsequence | [[LeetCode XXXX]] | Binary Indexed Tree, Segment Tree, Array, Dynamic Programming | Medium |
0354 | Russian Doll Envelopes | [[LeetCode XXXX]] | Array, Binary Search, Dynamic Programming, Sorting | Hard |
0053 | Maximum Subarray | [[LeetCode XXXX]] | Array, Divide and Conquer, Dynamic Programming | Easy |
0152 | Maximum Product Subarray | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
0918 | Maximum Sum Circular Subarray | [[LeetCode XXXX]] | Queue, Array, Divide and Conquer, Dynamic Programming, Monotonic Queue | Medium |
0198 | House Robber | [[LeetCode XXXX]] | Array, Dynamic Programming | Easy |
0213 | House Robber II | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
0740 | Delete and Earn | | Array, Hash Table, Dynamic Programming | Medium |
1388 | Pizza With 3n Slices | | Greedy, Array, Dynamic Programming, Heap (Priority Queue) | Hard |
0873 | Length of Longest Fibonacci Subsequence | [[LeetCode XXXX]] | Array, Hash Table, Dynamic Programming | Medium |
1027 | Longest Arithmetic Subsequence | | Array, Hash Table, Binary Search, Dynamic Programming | Medium |
1055 | Shortest Way to Form String | | Greedy, Two Pointers, String | Medium |
0368 | Largest Divisible Subset | | Array, Math, Dynamic Programming, Sorting | Medium |
0032 | Longest Valid Parentheses | [[LeetCode XXXX]] | Stack, String, Dynamic Programming | Hard |
0413 | Arithmetic Slices | | Array, Dynamic Programming | Medium |
0091 | Decode Ways | [[LeetCode XXXX]] | String, Dynamic Programming | Medium |
0639 | Decode Ways II | [[LeetCode XXXX]] | String, Dynamic Programming | Hard |
0132 | Palindrome Partitioning II | | String, Dynamic Programming | Hard |
1220 | Count Vowels Permutation | [[LeetCode XXXX]] | Dynamic Programming | Hard |
0338 | Counting Bits | [[LeetCode XXXX]] | Bit Manipulation, Dynamic Programming | Medium |
0801 | Minimum Swaps To Make Sequences Increasing | [[LeetCode XXXX]] | Array, Dynamic Programming | Hard |
0871 | Minimum Number of Refueling Stops | | Greedy, Array, Dynamic Programming, Heap (Priority Queue) | Hard |
0045 | Jump Game II | [[LeetCode XXXX]] | Greedy, Array, Dynamic Programming | Hard |
0813 | Largest Sum of Averages | | Array, Dynamic Programming, Prefix Sum | Medium |
0887 | Super Egg Drop | [[LeetCode XXXX]] | Math, Binary Search, Dynamic Programming | Hard |
0256 | Paint House | | Array, Dynamic Programming | Medium |
0265 | Paint House II | | Array, Dynamic Programming | Hard |
1473 | Paint House III | | Array, Dynamic Programming | Hard |
0975 | Odd Even Jump | | Stack, Array, Dynamic Programming, Ordered Set, Monotonic Stack | Hard |
0403 | Frog Jump | [[LeetCode XXXX]] | Array, Dynamic Programming | Hard |
1478 | Allocate Mailboxes | | Array, Math, Dynamic Programming, Sorting | Hard |
1230 | Toss Strange Coins | | Math, Dynamic Programming, Probability and Statistics | Medium |
0410 | Split Array Largest Sum | [[LeetCode XXXX]] | Greedy, Array, Binary Search, Dynamic Programming, Prefix Sum | Hard |
1751 | Maximum Number of Events That Can Be Attended II | | Array, Binary Search, Dynamic Programming, Sorting | Hard |
1787 | Make the XOR of All Segments Equal to Zero | | Bit Manipulation, Array, Dynamic Programming | Hard |