Dynamic programming
Problems on dynamic programming, including counting paths in a grid, the longest increasing and longest common subsequences, edit distance, knapsack, coin change, dynamic programming on intervals, trees, digits and subsets, and games solved by computing winning states.
The introduction in the Dynamic programming section works through the method step by step. Narrower problem sets are under Knapsack, Bitmasks and Dynamic programming optimization.
المسائل
Patriotic Painting 2#10823
صعب جدًا
Logic#10838
متوسط
Set#10839
صعب
Volunteering#10840
متوسط
Divisible by 3#10884
سهل جدًا
Plagiarism Detection#10919
صعب جدًا
Miners#10952
متوسط
Pretty#10957
سهل
Wall#10958
سهل
Стовпчики#10970
صعب جدًا
Покупка#11017
سهل جدًا
Lumberjack villages#11033
صعب جدًا
Random tree#11054
صعب جدًا
Chain Repair#11060
متوسط