Uncategorized : Dynamic Programming

This list is used to train students. Do not use it without supervision.

• Flip Cards

• Maximum Sum Increasing Subsequence

• Block Sequence
• Hungry Games

• Leaping Tak

• Sending a Sequence Over the Network

• Chef Loves Beautiful Strings (Easy Version)
• Chef Loves Beautiful Strings (Hard Version)

• Finding the number of palindromes (Large)

• Subsequence Path

• Christmas Present 2
• Merchant Takahashi
• Blocking Elements
  • Christmas Present 2 and Blocking Elements are similar. They should be solved atleast months apart.

• Med-imize
• Sakurako’s Test

• Hop Sugoroku

• Colored Balls
  • Solve in O(n^3) in first attempt.

• The Most Reckless Defense

• Counting Binary Strings
  • Unconstrained Binary Strings
  • Binary Strings with No Consecutive Zeroes
  • K Zero Stream
  • K Zero Stream (Hard)
  • Prologue to Counting Binary Strings

• Subsequences (hard version)
• Paths to a Goal

• Substring Compression
  • Solve in O(n^2) only. The DP can be optimized from O(n^4) to O(n^3) to O(n^2).

• Clear the String
  • Jazz
  • Clear the String and Jazz are almost similar. They should be solved atleast months apart.

• Increasing Subsequence
  • Smooth Subsequence
    • Resource : CF Blog
• Useless for LIS

• Ksyusha and the Loaded Set

• Rabbit Carrot

• Earn to Advance

• Keep Connect

• Erase Subarrays

• What is the relative difficulty of Keep Connect and Erase Subarrays?