🎓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

Problems9

All SourcesLeetCodeCodeforcesBOJCustom
All LevelsEasyMediumHard
graphs
Custom#cp013-529
2000

Graph Degree Redistribution

Phase 5 / graphs, degree, greedy

graphsdegreegreedy
Custom#cp002-157
2100

Graph Reversal Path Cost

Phase 5 / graphs, shortest paths

graphsdijkstrareverse edge
Custom#cpq001
1400

Grid Teleportation Path

Phase 6 / graph/grid/shortest-path

graphsbfsgridssimulation
Custom#cp002
1900

Graph Shortest Path with Parity Constraint

Phase 6 / graphs, shortest paths, parity

graphsdijkstraparityshortest path
Custom#cptp005
2200

Directed Graph Two-Edge Connectivity

Phase 5 / graph_theory, connectivity

graphsconnectivityedge-disjoint pathsstrongly-connected
Custom#P020
1700

Critical Edge Removals for Disconnection

Phase 2 / Graphs, Bridges

graphsbridgescut
Custom#P018
2200

Bitmask Minimal Path

Phase 2 / Graphs, Bitmask Dijkstra

graphsbitmaskdijkstra
Custom#P005
1700

Connected Components After Queries

Phase 2 / DSU, Offline Processing

dsuofflinegraphs
Custom#p012
2450

Path Maximum with Shortcuts

Phase 1 / dijkstra, optimization

graphsdijkstrashortest pathoptimization