LogiQuest

Graphs & Trees

BFS, DFS, shortest paths, components and tree queries.

46 problems

StatusTitleDifficulty
1. Count Binary Search TreesMedium
2. Shortest Path (Unweighted)Easy
3. Connected ComponentsEasy
4. Cycle in an Undirected GraphMedium
5. Cycle in a Directed GraphMedium
6. Topological OrderMedium
7. Shortest Path (Weighted)Medium
8. Minimum Spanning TreeMedium
9. Is the Graph Bipartite?Medium
10. Diameter of a TreeMedium
11. Tree Height from Parent ArrayEasy
12. Friend CirclesEasy
13. Rotting OrangesMedium
14. Count Regions of Same ColourEasy
15. Word LadderHard
16. Lowest Common AncestorHard
17. Paths in a DAGMedium
18. Knight's Shortest PathMedium
19. Snakes and LaddersHard
20. Inorder TraversalEasy
21. Preorder TraversalEasy
22. Postorder TraversalEasy
23. Level Order by LinesEasy
24. Zigzag Level OrderMedium
25. Maximum Depth of a Binary TreeEasy
26. Minimum DepthEasy
27. Count and Sum of NodesEasy
28. Count LeavesEasy
29. Symmetric TreeEasy
30. Height-Balanced TreeEasy
31. Diameter of a Binary TreeEasy
32. Root-to-Leaf Path SumEasy
33. Validate a BSTMedium
34. K-th Smallest in a BSTMedium
35. LCA in a BSTEasy
36. Build a BST by InsertionEasy
37. Range Sum of a BSTEasy
38. Right Side ViewMedium
39. Left Side ViewEasy
40. Level Sums and Widest LevelMedium
41. Same TreeEasy
42. K Largest ElementsEasy
43. Merge K Sorted ListsHard
44. Connect Ropes at Minimum CostMedium
45. K-th Largest in a StreamMedium
46. Task SchedulerMedium

46 of 46 problems