LeetCode Record
Ctrlk
  • Sort
  • linked list
  • Queue
  • Stack (some may involve tree map)
  • Priority Queue
  • Map/Set
  • Binary Search
  • 2 pointer (including sliding window)
  • BFS (some may be solved by union find)
  • topological sort
  • BST binary search tree
  • DFS / Backtracking
  • DP
    • 300 Longest increasing subsequence
    • 368. Largest Divisible Subset
    • 🤯1235 max profit in job scheduling
    • 1335 minimum difficulty of a job schedule
    • 😕1216 valid palindrome III
    • 🙁97 interleaving string
    • 472 concatenated words
    • 53 maximum subarray
    • 85 Maximal Rectangle
    • 122. Best Time to Buy and Sell Stock II
    • 221 Maximal Square
    • 518 coin change II (01背包)
    • 115 distinct subsequences
    • 198 House robber
    • 213. House Robber II
    • 740. Delete and Earn
  • Prefix sum
  • Union find
  • Swipe Line
  • Segment tree
  • Monotonic Stack/Queue
  • Trie
  • TreeMap
  • Sessions
    • BFS
Powered by GitBook
On this page

DP

300 Longest increasing subsequence368. Largest Divisible Subset🤯1235 max profit in job scheduling1335 minimum difficulty of a job schedule😕1216 valid palindrome III🙁97 interleaving string472 concatenated words53 maximum subarray85 Maximal Rectangle122. Best Time to Buy and Sell Stock II221 Maximal Square518 coin change II (01背包)115 distinct subsequences198 House robber213. House Robber II740. Delete and Earn
Previous437 path sum IIINext300 Longest increasing subsequence

Last updated 1 year ago