## **Graph 101: Comprehensive Topic Wise Questions**\n\n### **Introduction**\n\nWelcome to **"Graph 101: Comprehensive Topic Wise Questions"** \u2013 This article serves as a curated collection of Questions to kick off each topic. Let\'s dive in!\n\n***Note:** This is still in making I will update this list as I find more interesting questions : ).*\n\n### **INDEX**\n\n||**Topic**|\n| :-: | :-: |\n|1\\.|[DFS/BFS](#_ptga2c73cclp)|\n|2\\.|[DP on Graphs](#_bwe32g6u6gvx)|\n|3\\.|[DSU](#_nwmj9yhh1kgi)|\n|4\\.|[Dijkstra Algorithm](#_ulupmcq1xb1p)|\n|5\\.|[TopoSort](#_h6ej6a35z00l)|\n|6\\.|[Bridges](#_tdnarexms36a)|\n|7\\.|[Eulerian Path](#_goumjk8fbdw)|\n|8\\.|[LCA algorithm](#_tw1revu0cogm)|\n|9\\.|[Special Type of Problems](#_gzo5gnmcgg4d)|\n\n### <a name="_ptga2c73cclp"></a>**DFS/BFS**\n||**Questions**|\n| :-: | :-: |\n|1\\.|[Fruits On Tree](https://www.thejoboverflow.com/problem/229/)|\n|2\\.|[Escape The Maze (easy version)](https://codeforces.com/problemset/problem/1611/E1)|\n|3\\.|[Solve The Maze](https://codeforces.com/problemset/problem/1365/D)|\n|4\\.|[Find Minimum Diameter After Merging Two Trees](https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/)|\n\n\n### <a name="_bwe32g6u6gvx"></a>**DP on Graphs**\n||**Questions**|\n| :-: | :-: |\n|1\\.|[Fruits On Tree](https://www.thejoboverflow.com/problem/229/)|\n|2\\.|[Escape The Maze (easy version)](https://codeforces.com/problemset/problem/1611/E1)|\n|3\\.|[Parsa\'s Humongous Tree](https://codeforces.com/contest/1528/problem/A)|\n|4\\.|[Choosing Capital for Treeland](https://codeforces.com/contest/219/problem/D)|\n|5\\.|[The Fair Nut and the Best Path](https://codeforces.com/contest/1083/problem/A)|\n|6\\.|[Bakry and Partitioning](https://codeforces.com/problemset/problem/1592/C)|\n|7\\.|[Count Valid Paths in a Tree](https://leetcode.com/problems/count-valid-paths-in-a-tree/)|\n|8\\.|[Tree XOR](https://codeforces.com/contest/1882/problem/D)|\n|9\\.|[Number of Increasing Paths in a Grid](https://leetcode.com/problems/number-of-increasing-paths-in-a-grid/)|\n|10\\.|[Sum of Distances in Tree](https://leetcode.com/problems/sum-of-distances-in-tree/)|\n|11\\.|[Largest Color Value in a Directed Graph](https://leetcode.com/problems/largest-color-value-in-a-directed-graph/)|\n|12\\.|[Count Valid Paths in a Tree](https://leetcode.com/problems/count-valid-paths-in-a-tree/)|\n|13\\.|[Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/)|\n|14\\.|[Minimize the Total Price of the Trips](https://leetcode.com/problems/minimize-the-total-price-of-the-trips/)|\n\n\n### <a name="_nwmj9yhh1kgi"></a>**DSU**\n||**Questions**|\n| :-: | :-: |\n|1\\.|[Remove Max Number of Edges to Keep Graph Fully Traversable](https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/)|\n|2\\.|[Checking Existence of Edge Length Limited Paths](https://leetcode.com/problems/checking-existence-of-edge-length-limited-paths/)|\n|3\\.|[Number of Good Paths](https://leetcode.com/problems/number-of-good-paths/description/)|\n|4\\.|[Minimize Malware Spread II](https://leetcode.com/problems/minimize-malware-spread-ii/)|\n|5\\.|[Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)|\n|6\\.|[Regions Cut By Slashes](https://leetcode.com/problems/regions-cut-by-slashes/)|\n\n\n### <a name="_ulupmcq1xb1p"></a>**Dijkstra Algorithm**\n||**Questions**|\n| :-: | :-: |\n|1\\.|[Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/)|\n|2\\.|[Minimum Cost to Reach Destination in Time](https://leetcode.com/problems/minimum-cost-to-reach-destination-in-time/)|\n|3\\.|[Minimum Cost to Make at Least One Valid Path in a Grid](https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/)|\n|4\\.|[Minimum Cost of a Path With Special Roads](https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads/)|\n\n\n### <a name="_h6ej6a35z00l"></a>**TopoSort**\n||**Questions**|\n| :- | :-: |\n|1\\.|[Build a Matrix With Conditions](https://leetcode.com/problems/build-a-matrix-with-conditions/)|\n|2\\.|[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)|\n\n\n### <a name="_tdnarexms36a"></a>**Bridges**\n||**Questions**|\n| :- | :-: |\n|1\\.|[Critical Connections in a Network](https://leetcode.com/problems/critical-connections-in-a-network/)|\n|2\\.|[Special Edge](https://www.thejoboverflow.com/problem/220/)|\n\n\n### <a name="_goumjk8fbdw"></a>**Eulerian Path**\n||**Questions**|\n| :- | :-: |\n|1\\.|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)|\n|2\\.|[Valid Arrangement of Pairs](https://leetcode.com/problems/valid-arrangement-of-pairs/)|\n\n### <a name="_tw1revu0cogm"></a>**LCA algorithm**\n\n||**Questions**|\n| :- | :-: |\n|1\\.|[Minimum Edge Weight Equilibrium Queries in a Tree](https://leetcode.com/problems/minimum-edge-weight-equilibrium-queries-in-a-tree/)|\n\n\n### <a name="_gzo5gnmcgg4d"></a>**Special Type of Problems**\n||**Questions**|\n| :-: | :-: |\n|1\\.|[Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/)|\n|2\\.|[Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph/)|\n|3\\.|[Minimum Degree of a Connected Trio in a Graph](https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph/)|\n|4\\.|[Maximum Score of a Node Sequence](https://leetcode.com/problems/maximum-score-of-a-node-sequence/)|\n|5\\.|[Uber 28 Q1](https://www.thejoboverflow.com/problem/56/)|\n|6\\.|[Friends](https://www.thejoboverflow.com/problem/249/)|\n\n\nGraph 101: Comprehensive Topic Wise Questions

Graph 101: Comprehensive Topic Wise Questions\n\n### Introduction\n\nWelcome to "Graph 101: Comprehensive Topic Wise Questions" \u2013 This article serves as a 

	Topic
1.	DFS/BFS
2.	DP on Graphs
3.	DSU
4.	Dijkstra Algorithm
5.	TopoSort
6.	Bridges
7.	Eulerian Path
8.	LCA algorithm
9.	Special Type of Problems

	Questions
1.	Fruits On Tree
2.	Escape The Maze (easy version)
3.	Solve The Maze
4.	Find Minimum Diameter After Merging Two Trees

	Questions
1.	Fruits On Tree
2.	Escape The Maze (easy version)
3.	Parsa's Humongous Tree
4.	Choosing Capital for Treeland
5.	The Fair Nut and the Best Path
6.	Bakry and Partitioning
7.	Count Valid Paths in a Tree
8.	Tree XOR
9.	Number of Increasing Paths in a Grid
10.	Sum of Distances in Tree
11.	Largest Color Value in a Directed Graph
12.	Count Valid Paths in a Tree
13.	Minimum Cost to Make at Least One Valid Path in a Grid
14.	Minimize the Total Price of the Trips

	Questions
1.	Remove Max Number of Edges to Keep Graph Fully Traversable
2.	Checking Existence of Edge Length Limited Paths
3.	Number of Good Paths
4.	Minimize Malware Spread II
5.	Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
6.	Regions Cut By Slashes

	Questions
1.	Reachable Nodes In Subdivided Graph
2.	Minimum Cost to Reach Destination in Time
3.	Minimum Cost to Make at Least One Valid Path in a Grid
4.	Minimum Cost of a Path With Special Roads

	Questions
1.	Shortest Path Visiting All Nodes
2.	Maximum Path Quality of a Graph
3.	Minimum Degree of a Connected Trio in a Graph
4.	Maximum Score of a Node Sequence
5.	Uber 28 Q1
6.	Friends