🎓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

Problems200

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
Custom#P011
2000

K-th Shortest Path in DAG

Phase 2 / DAG, Path Enumeration

dagshortest pathenumeration
Custom#P010
1800

Pairwise Minimum Path Sum

Phase 2 / Tree, Path Queries

treepathpairwisemin
Custom#P009
1900

Topological Order with Degree Constraint

Phase 2 / DP, Topological Sorting

dptoposortenumeration
Custom#P008
1400

Majority Element Streams

Phase 2 / Boyer-Moore, Hashing

streamsmajorityboyer-moore
Custom#P007
1800

Unique Value Submatrix Count

Phase 2 / 2D Sliding Window, Hashing

2d arraycountinghash
Custom#P006
1600

Minimal Swaps to K-Partition

Phase 2 / Greedy, Partitioning

greedypartitionswaps
Custom#P005
1700

Connected Components After Queries

Phase 2 / DSU, Offline Processing

dsuofflinegraphs
Custom#P004
1600

Partitioned GCD Sum

Phase 2 / DP, GCD

dpgcdpartition
Custom#P003
1500

Modulo K Longest Increasing Subsequence

Phase 2 / DP, Number Theory

dpnumber theorysubsequence
Custom#P002
1800

Tree Rerooting Value

Phase 2 / Tree DP, Rerooting

treererootingdp
Custom#P001
1400

Sliding Median XOR

Phase 2 / Sliding Window, Order Statistics

sliding windoworder-statisticsxor
Custom#p020
1900

Weighted Longest Common Subsequence

Phase 1 / dp, lcs, greedy

dpstringlcsgreedy
1112131415