OJ
Ctrlk
  • 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
Powered by GitBook
On this page

Was this helpful?

  1. Dynamic Programming I

Subsequence

Longest Increasing Subsequence1395. Count Number of Teams1027. Longest Arithmetic SequenceNumber of Longest Increasing SubsequenceWiggle SubsequenceLargest Divisible SubsetMaximum Length of Pair Chain940. Distinct Subsequences II727. Minimum Window SubsequenceBurst Balloons1458. Max Dot Product of Two Subsequences1696. Jump Game VI1626. Best Team With No Conflicts
Previous1344. Jump Game VNextLongest Increasing Subsequence

Last updated 6 years ago

Was this helpful?