πŸ“–
LeetCode
search
⌘Ctrlk
πŸ“–
LeetCode
  • 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
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Dynamic Programming

2.sequence

Sell Stockchevron-right115.Distinct-Subsequenceschevron-right132.Palindrome-Partitioning-IIchevron-right300.Longest-Increasing-Subsequencechevron-right472.Concatenated-Wordschevron-right516.Longest-Palindromic-Subsequencechevron-right727.Minimum-Window-Subsequencechevron-right801.Minimum-Swaps-To-Make-Sequences-Increasingchevron-rightK Sumchevron-rightLong Common Sequencechevron-rightMaximum Subarray Iiichevron-rightMinimum Adjustment Costchevron-right
Previous980.Unique-Paths-IIIchevron-leftNextSell Stockchevron-right

Last updated 4 years ago