🎓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

Problems20

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
graph
Custom#cpq013-921
2400

Sparse Graph Reversal Distance

Phase 5 / 0-1-bfs, graph

graphbfsedge-reversal
Custom#cpq003-882
2100

Sum of Distinct Graph Paths

Phase 2 / dag, topological-order, reachability

graphdagquery
Custom#P006-366
2100

Graph Path Swap Parity

Phase 5 / graphs/parity/path_reversal

graphbfsparityquery
Custom#P002-431
2000

Maximal XOR Connected Subgraph

Phase 5 / graphs/xor/connected_subgraph

XORgraphsubgraph
Custom#cpq019
1500

Colorful Connected Components

Phase 6 / dsu/components

graphdsuconnected-componentscolors
Custom#cpq013
1550

Graph Degree Parity Transform

Phase 6 / graph/degree-parity

graphparitydegreegreedy
Custom#cpq009
2500

Minimal Cost All-Reachability in DAG

Phase 6 / graph/dag/transitive-closure

graphdagminimumreachability
Custom#cp007
2200

Bipartite Subgraph Covering

Phase 6 / graph decomposition, coloring, matching

graphdecompositioncoloringbipartite
Custom#cptp007
2100

Bipartite Path Color Switches

Phase 5 / bfs, multi-state_shortest

bfscoloringgraphqueries
Custom#cp-tp3-014
2150

Maximal Pairwise Flow Assignment

Phase 3 / orientation-flow

graphorientationflowgreedy
Custom#cp-tp3-011
1950

K-Bounded Shortest Cycle

Phase 3 / graph-cycles

graphcycleshortest-pathbounded-search
Custom#cp-tp3-004
1700

Monochrome Component Removals

Phase 3 / graph-components

graphcomponentscoloringgreedy
12