← back

Graph Theory

144 questions · 0 seen

All Graph Theory problems

Problems

133 Clone Graph
207 Course Schedule
210 Course Schedule II
310 Minimum Height Trees
329 Longest Increasing Path in a Matrix
332 Reconstruct Itinerary
399 Evaluate Division
547 Number of Provinces
684 Redundant Connection
685 Redundant Connection II
743 Network Delay Time
753 Cracking the Safe
765 Couples Holding Hands
785 Is Graph Bipartite?
787 Cheapest Flights Within K Stops
797 All Paths From Source to Target
802 Find Eventual Safe States
834 Sum of Distances in Tree
841 Keys and Rooms
847 Shortest Path Visiting All Nodes
851 Loud and Rich
882 Reachable Nodes In Subdivided Graph
886 Possible Bipartition
913 Cat and Mouse
924 Minimize Malware Spread
928 Minimize Malware Spread II
947 Most Stones Removed with Same Row or Column
990 Satisfiability of Equality Equations
997 Find the Town Judge
1042 Flower Planting With No Adjacent
1129 Shortest Path with Alternating Colors
1192 Critical Connections in a Network
1203 Sort Items by Groups Respecting Dependencies
1298 Maximum Candies You Can Get from Boxes
1311 Get Watched Videos by Your Friends
1319 Number of Operations to Make Network Connected
1334 Find the City With the Smallest Number of Neighbors at a Threshold Distance
1361 Validate Binary Tree Nodes
1368 Minimum Cost to Make at Least One Valid Path in a Grid
1377 Frog Position After T Seconds
1462 Course Schedule IV
1466 Reorder Routes to Make All Paths Lead to the City Zero
1489 Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
1494 Parallel Courses II
1514 Path with Maximum Probability
1557 Minimum Number of Vertices to Reach All Nodes
1579 Remove Max Number of Edges to Keep Graph Fully Traversable
1584 Min Cost to Connect All Points
1591 Strange Printer II
1615 Maximal Network Rank
1632 Rank Transform of a Matrix
1697 Checking Existence of Edge Length Limited Paths
1719 Number Of Ways To Reconstruct A Tree
1728 Cat and Mouse II
1761 Minimum Degree of a Connected Trio in a Graph
1782 Count Pairs Of Nodes
1786 Number of Restricted Paths From First to Last Node
1791 Find Center of Star Graph
1857 Largest Color Value in a Directed Graph
1916 Count Ways to Build Rooms in an Ant Colony
1928 Minimum Cost to Reach Destination in Time
1971 Find if Path Exists in Graph
1976 Number of Ways to Arrive at Destination
2039 The Time When the Network Becomes Idle
2045 Second Minimum Time to Reach Destination
2050 Parallel Courses III
2065 Maximum Path Quality of a Graph
2076 Process Restricted Friend Requests
2092 Find All People With Secret
2097 Valid Arrangement of Pairs
2101 Detonate the Maximum Bombs
2115 Find All Possible Recipes from Given Supplies
2127 Maximum Employees to Be Invited to a Meeting
2192 All Ancestors of a Node in a Directed Acyclic Graph
2203 Minimum Weighted Subgraph With the Required Paths
2242 Maximum Score of a Node Sequence
2246 Longest Path With Different Adjacent Characters
2285 Maximum Total Importance of Roads
2290 Minimum Obstacle Removal to Reach Corner
2316 Count Unreachable Pairs of Nodes in an Undirected Graph
2328 Number of Increasing Paths in a Grid
2359 Find Closest Node to Given Two Nodes
2360 Longest Cycle in a Graph
2368 Reachable Nodes With Restrictions
2374 Node With Highest Edge Score
2392 Build a Matrix With Conditions
2421 Number of Good Paths
2467 Most Profitable Path in a Tree
2477 Minimum Fuel Cost to Report to the Capital
2492 Minimum Score of a Path Between Two Cities
2493 Divide Nodes Into the Maximum Number of Groups
2497 Maximum Star Sum of a Graph
2508 Add Edges to Make Degrees of All Nodes Even
2577 Minimum Time to Visit a Cell In a Grid
2603 Collect Coins in a Tree
2608 Shortest Cycle in a Graph
2642 Design Graph With Shortest Path Calculator
2646 Minimize the Total Price of the Trips
2662 Minimum Cost of a Path With Special Roads
2685 Count the Number of Complete Components
2699 Modify Graph Edge Weights
2846 Minimum Edge Weight Equilibrium Queries in a Tree
2858 Minimum Edge Reversals So Every Node Is Reachable
2876 Count Visited Nodes in a Directed Graph
2924 Find Champion II
2959 Number of Possible Sets of Closing Branches
2976 Minimum Cost to Convert String I
2977 Minimum Cost to Convert String II
3015 Count the Number of Houses at a Certain Distance I
3017 Count the Number of Houses at a Certain Distance II
3108 Minimum Cost Walk in Weighted Graph
3112 Minimum Time to Visit Disappearing Nodes
3123 Find Edges in Shortest Paths
3203 Find Minimum Diameter After Merging Two Trees
3241 Time Taken to Mark All Nodes
3243 Shortest Distance After Road Addition Queries I
3244 Shortest Distance After Road Addition Queries II
3286 Find a Safe Walk Through a Grid
3310 Remove Methods From Project
3311 Construct 2D Grid Matching Graph Layout
3341 Find Minimum Time to Reach Last Room I
3342 Find Minimum Time to Reach Last Room II
3377 Digit Operations to Make Two Integers Equal
3387 Maximize Amount After Two Days of Conversions
3419 Minimize the Maximum Edge Weight of Graph
3435 Frequencies of Shortest Supersequences
3493 Properties Graph
3528 Unit Conversion I
3530 Maximum Profit from Valid Topological Order in DAG
3532 Path Existence Queries in a Graph I
3534 Path Existence Queries in a Graph II
3543 Maximum Weighted K-Edge Path
3547 Maximum Sum of Edge Values in a Graph
3594 Minimum Time to Transport All Individuals
3600 Maximize Spanning Tree Stability with Upgrades
3604 Minimum Time to Reach Destination in Directed Graph
3607 Power Grid Maintenance
3608 Minimum Time for K Connected Components
3613 Minimize Maximum Component Cost
3615 Longest Palindromic Path in Graph
3620 Network Recovery Pathways
3650 Minimum Cost Path with Edge Reversals
3710 Maximum Partition Factor
3812 Minimum Edge Toggles on a Tree