🎓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#ct-p6-05
2500

Dynamic SCC Longest Condensation Path

Phase 6 / combined-techniques

sccofflinedag-dp
Custom#ct-p6-04
2450

Persistent K-th with Point Updates

Phase 6 / combined-techniques

persistent-segment-treeorder-statisticsoffline
Custom#ct-p6-03
2400

Centroid Nearest Active

Phase 6 / combined-techniques

treecentroiddata-structure
Custom#ct-p6-02
2350

Directed Move Grundy

Phase 6 / game-theory

game-theorygrundydp
Custom#ct-p6-01
2300

Constructive Modulo Permutation

Phase 6 / constructive-math

constructivemathgreedy
Custom#ct-p5-03
2250

Versioned String Frequency

Phase 5 / string-advanced

persistent-segment-treestringdata-structure
Custom#ct-p5-02
2300

Lower-Bound Flow Feasibility

Phase 5 / flows

flowgraphinvariant
Custom#ct-p5-01
2200

Subset Route Compression

Phase 5 / advanced-dp

bitmask-dpshortest-pathmatching
Custom#ct-p4-03
2100

Rollback DSU Interval Connectivity

Phase 4 / dsu-rollback

dsuofflinedivide-and-conquer
Custom#ct-p4-02
2050

Offline Greater-Than Queries

Phase 4 / fenwick-offline

offlinefenwicksorting
Custom#ct-p4-01
2000

Range Add Minimum Index

Phase 4 / segment-tree

segment-treelazy-propagationinvariant
Custom#ct-p3-03
1900

Shortest Path with Free Coupons

Phase 3 / graph-shortest-path

graphdijkstrastate-space
1314151617