🎓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#P013
2000

Swap to Sort with Constraints

Phase 2 / Graphs, Permutations

graphpermutationswapping
Custom#p016
1600

Odd Degree Vertex Removal

Phase 1 / graph, parity, dp

graphdegreeparitydp
Custom#p014
1700

Tree Diameter After Edge Addition

Phase 1 / tree, diameter, greedy

treediametergraphgreedy
Custom#p006
1750

Minimal Operations to Make Graph Bipartite

Phase 1 / graph, dfs, coloring

graphbipartitedfscycles
Custom#p003
1900

Cycle-Finding Graph Labeler

Phase 1 / mst, parity, union_find

graphmstforestunion-find
Custom#ct-p5-02
2300

Lower-Bound Flow Feasibility

Phase 5 / flows

flowgraphinvariant
Custom#ct-p3-03
1900

Shortest Path with Free Coupons

Phase 3 / graph-shortest-path

graphdijkstrastate-space
Custom#ct-p2-02
1650

Color Teleport BFS

Phase 2 / bfs-state-model

graphbfsstate-modeling
12