OJ
search
⌘Ctrlk
OJ
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
    • 走格
    • Subsequence
      • Longest Increasing Subsequence
      • 1395. Count Number of Teams
      • 1027. Longest Arithmetic Sequence
      • Number of Longest Increasing Subsequence
      • Wiggle Subsequence
      • Largest Divisible Subset
      • Maximum Length of Pair Chain
      • 940. Distinct Subsequences II
      • 727. Minimum Window Subsequence
      • Burst Balloons
      • 1458. Max Dot Product of Two Subsequences
      • 1696. Jump Game VI
      • 1626. Best Team With No Conflicts
    • Counting Bits
    • 887. Super Egg Drop
    • 674. Longest Continuous Increasing Subsequence
    • Integer Break
    • Catalan Number
    • Count Numbers with Unique Digits
    • 2 Keys Keyboard
    • 背包问题
    • DFS + Memorization
    • Palindromic Strings
    • 多状态DP
    • f长度与input array长度无关
    • 多指针
    • Partition
    • Subarray Sum
    • String Match
    • Game Theory
    • Flip String to Monotone Increasing
    • 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance
    • Maximum Rectangle
    • 1513. Number of Substrings With Only 1s
    • 哈密顿图
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Dynamic Programming I

Subsequence

Longest Increasing Subsequencechevron-right1395. Count Number of Teamschevron-right1027. Longest Arithmetic Sequencechevron-rightNumber of Longest Increasing Subsequencechevron-rightWiggle Subsequencechevron-rightLargest Divisible Subsetchevron-rightMaximum Length of Pair Chainchevron-right940. Distinct Subsequences IIchevron-right727. Minimum Window Subsequencechevron-rightBurst Balloonschevron-right1458. Max Dot Product of Two Subsequenceschevron-right1696. Jump Game VIchevron-right1626. Best Team With No Conflictschevron-right
Previous1344. Jump Game Vchevron-leftNextLongest Increasing Subsequencechevron-right

Last updated 6 years ago