📖
LeetCode
CtrlK
  • Introduction
  • Array
  • Basic Knowledge
  • Binary Search
  • Binary Tree
  • Bit
  • Data Structure
  • Divide Conquer
  • Dynamic Programming
    • 1.position
    • 2.sequence
      • Sell Stock
      • 115.Distinct-Subsequences
      • 132.Palindrome-Partitioning-II
      • 300.Longest-Increasing-Subsequence
      • 472.Concatenated-Words
      • 516.Longest-Palindromic-Subsequence
      • 727.Minimum-Window-Subsequence
      • 801.Minimum-Swaps-To-Make-Sequences-Increasing
      • K Sum
      • Long Common Sequence
      • Maximum Subarray Iii
      • Minimum Adjustment Cost
    • Backpack Problem
    • 区间型
    • 矩阵坐标
    • 1049.Last-Stone-Weight-II
    • 1140.Stone-Game-II
    • 1235.Maximum-Profit-in-Job-Scheduling
    • 1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
    • 1406.Stone-Game-III
    • 774.Minimize-Max-Distance-to-Gas-Station
    • Longest Arithmetic Sequence
  • Graph Search
  • Linked List
  • Matrix
  • Mergesort
  • Numbers
  • Other
  • Permutation And Combination
  • Queue
  • Sort Algorithm
  • Stack
  • String
  • Toposort
  • Trie Tree
  • Two Pointers
  • Union Find
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming

2.sequence

Sell Stock115.Distinct-Subsequences132.Palindrome-Partitioning-II300.Longest-Increasing-Subsequence472.Concatenated-Words516.Longest-Palindromic-Subsequence727.Minimum-Window-Subsequence801.Minimum-Swaps-To-Make-Sequences-IncreasingK SumLong Common SequenceMaximum Subarray IiiMinimum Adjustment Cost
Previous980.Unique-Paths-IIINextSell Stock

Last updated 4 years ago

Was this helpful?