Tag: graph
- Add Edges to Make Degrees of All Nodes Even
- Alien Dictionary
- All Ancestors of a Node in a Directed Acyclic Graph
- All Paths from Source Lead to Destination
- All Paths From Source to Target
- Apply Substitutions
- Build a Matrix With Conditions
- Cat and Mouse II
- Cat and Mouse
- Cheapest Flights Within K Stops
- Check for Contradictions in Equations
- Checking Existence of Edge Length Limited Paths II
- Checking Existence of Edge Length Limited Paths
- Clone Graph
- Collect Coins in a Tree
- Connecting Cities With Minimum Cost
- Construct 2D Grid Matching Graph Layout
- Count Pairs Of Nodes
- Count the Number of Complete Components
- Count the Number of Houses at a Certain Distance I
- Count the Number of Houses at a Certain Distance II
- Count Unreachable Pairs of Nodes in an Undirected Graph
- Count Visited Nodes in a Directed Graph
- Count Ways to Build Rooms in an Ant Colony
- Couples Holding Hands
- Course Schedule II
- Course Schedule IV
- Course Schedule
- Cracking the Safe
- Critical Connections in a Network
- Design Excel Sum Formula
- Design Graph With Shortest Path Calculator
- Detonate the Maximum Bombs
- Digit Operations to Make Two Integers Equal
- Distance to a Cycle in Undirected Graph
- Divide Nodes Into the Maximum Number of Groups
- Evaluate Division
- Find a Safe Walk Through a Grid
- Find All People With Secret
- Find All Possible Recipes from Given Supplies
- Find Center of Star Graph
- Find Champion II
- Find Closest Node to Given Two Nodes
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
- Find Edges in Shortest Paths
- Find Eventual Safe States
- Find if Path Exists in Graph
- Find Minimum Diameter After Merging Two Trees
- Find Minimum Time to Reach Last Room I
- Find Minimum Time to Reach Last Room II
- Find Shortest Path with K Hops
- Find the Celebrity
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
- Find the Closest Marked Node
- Find the Town Judge
- Flower Planting With No Adjacent
- Frequencies of Shortest Supersequences
- Frog Position After T Seconds
- Get Watched Videos by Your Friends
- Graph Valid Tree
- Is Graph Bipartite?
- Jump Game VIII
- Keys and Rooms
- Largest Color Value in a Directed Graph
- Longest Cycle in a Graph
- Longest Increasing Path in a Matrix
- Longest Path With Different Adjacent Characters
- Loud and Rich
- Maximal Network Rank
- Maximize Amount After Two Days of Conversions
- Maximum Candies You Can Get from Boxes
- Maximum Cost of Trip With K Highways
- Maximum Employees to Be Invited to a Meeting
- Maximum Number of Accepted Invitations
- Maximum Path Quality of a Graph
- Maximum Score of a Node Sequence
- Maximum Star Sum of a Graph
- Maximum Total Importance of Roads
- Maximum XOR of Two Non-Overlapping Subtrees
- Min Cost to Connect All Points
- Minimize Malware Spread II
- Minimize Malware Spread
- Minimize Maximum Value in a Grid
- Minimize the Maximum Edge Weight of Graph
- Minimize the Total Price of the Trips
- Minimum Cost of a Path With Special Roads
- Minimum Cost to Buy Apples
- Minimum Cost to Convert String I
- Minimum Cost to Convert String II
- Minimum Cost to Make at Least One Valid Path in a Grid
- Minimum Cost to Reach City With Discounts
- Minimum Cost to Reach Destination in Time
- Minimum Cost Walk in Weighted Graph
- Minimum Degree of a Connected Trio in a Graph
- Minimum Edge Reversals So Every Node Is Reachable
- Minimum Edge Weight Equilibrium Queries in a Tree
- Minimum Fuel Cost to Report to the Capital
- Minimum Height Trees
- Minimum Number of Vertices to Reach All Nodes
- Minimum Obstacle Removal to Reach Corner
- Minimum Operations to Remove Adjacent Ones in Matrix
- Minimum Path Cost in a Hidden Grid
- Minimum Runes to Add to Cast Spell
- Minimum Score of a Path Between Two Cities
- Minimum Time to Break Locks II
- Minimum Time to Visit a Cell In a Grid
- Minimum Time to Visit Disappearing Nodes
- Minimum Weighted Subgraph With the Required Paths
- Modify Graph Edge Weights
- Most Profitable Path in a Tree
- Most Stones Removed with Same Row or Column
- Network Delay Time
- Node With Highest Edge Score
- Number of Connected Components in an Undirected Graph
- Number of Good Paths
- Number of Increasing Paths in a Grid
- Number of Operations to Make Network Connected
- Number of Possible Sets of Closing Branches
- Number of Provinces
- Number of Restricted Paths From First to Last Node
- Number of Ways to Arrive at Destination
- Number Of Ways To Reconstruct A Tree
- Optimize Water Distribution in a Village
- Parallel Courses II
- Parallel Courses III
- Parallel Courses
- Path with Maximum Probability
- Paths in Maze That Lead to Same Room
- Possible Bipartition
- Process Restricted Friend Requests
- Properties Graph
- Rank Transform of a Matrix
- Reachable Nodes In Subdivided Graph
- Reachable Nodes With Restrictions
- Reconstruct Itinerary
- Redundant Connection II
- Redundant Connection
- Remove Max Number of Edges to Keep Graph Fully Traversable
- Remove Methods From Project
- Reorder Routes to Make All Paths Lead to the City Zero
- Satisfiability of Equality Equations
- Second Minimum Time to Reach Destination
- Sequence Reconstruction
- Shortest Cycle in a Graph
- Shortest Distance After Road Addition Queries I
- Shortest Distance After Road Addition Queries II
- Shortest Path in a Hidden Grid
- Shortest Path Visiting All Nodes
- Shortest Path with Alternating Colors
- Sort Items by Groups Respecting Dependencies
- Strange Printer II
- Sum of Distances in Tree
- The Maze II
- The Maze III
- The Most Similar Path in a Graph
- The Time When the Network Becomes Idle
- Time Taken to Mark All Nodes
- Tree Diameter
- Valid Arrangement of Pairs
- Validate Binary Tree Nodes