🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
⏱️Coach🧩Problems🧠Thinking🎯Prompts🧠Review
SearchSettings
How I Study AI - Learn AI Papers & Lectures the Easy Way

Problems37

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
dp
Custom#cpq014-708
1600

Interval Longest Arithmetic Progression

Phase 2 / dp, range-query

dprange-queryarithmetic-progression
Custom#cpq007-536
1800

Grid Minimum Cost Painting

Phase 2 / dp, coloring, grid

dpgridcoloring
Custom#P020-341
2500

Weighted Subset XOR Query

Phase 6 / xor/subset_dp/weighted

xordpsubsetquery
Custom#P019-773
2100

Maximum Segment Set Sum

Phase 5 / dp/set/nonoverlap

dpsetsegments
Custom#P013-241
2200

K-Longest Paths in Grid

Phase 5 / dp/kth_path/grid

dpkth pathgrid
Custom#cp006-60
1600

Unique Path Lengths in Grid

Phase 5 / dp, path counting

dpgridpath counting
Custom#cpq017
1550

Rooted Subtree Maximum Path

Phase 6 / tree/dp

treedpmax-path
Custom#cpq011
1450

K-Color Consecutive Difference

Phase 6 / dp/greedy

greedydpcoloring
Custom#cpq004
1700

Edge Weight Matching

Phase 6 / dp/tree

dptreematching
Custom#cp020
1700

Minimum Cost to Recolor Grid

Phase 5 / dp, coloring, min cost

dpcoloringgrid
Custom#cp019
1500

Subset Sum Parity Count

Phase 4 / dp, parity, combinatorics

dpcombinatoricsparity
Custom#cp012
1700

K-Divisible Subset Partition

Phase 5 / modulo, dp, multiset

dpgreedypartitionmodulo
1234