Graph Theory Interview Questions

Array String Depth-First Search Breadth-First Search Graph Theory Topological Sort Directed Acyclic Graph

Rank

#329HardFrequency: 92.5%

Longest Increasing Path in a Matrix

Asked at DoorDash

Array Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Topological Sort Memoization Matrix Directed Acyclic Graph

Rank

#210MediumFrequency: 85.9%

Course Schedule II

Depth-First Search Breadth-First Search Graph Theory Topological Sort

Rank

#1424HardFrequency: 82.4%

Maximum Candies You Can Get from Boxes

Array Breadth-First Search Graph Theory

Rank

#207MediumFrequency: 82.3%

Course Schedule

Depth-First Search Breadth-First Search Graph Theory Topological Sort Directed Acyclic Graph

Rank

#277MediumFrequency: 80.7%

Find the Celebrity

Asked at LinkedIn

Two Pointers Graph Theory Interactive

Rank

#631HardFrequency: 78.6%

Design Excel Sum Formula

Array Hash Table String Graph Theory Design Topological Sort Matrix

Rank

#3105HardFrequency: 76.8%

Minimum Edge Reversals So Every Node Is Reachable

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory

Rank

#2230MediumFrequency: 76.6%

Minimum Cost to Reach City With Discounts

Asked at Flipkart

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

Rank

#133MediumFrequency: 70.5%

Clone Graph

Hash Table Depth-First Search Breadth-First Search Graph Theory

#10

Rank

#399MediumFrequency: 70.2%

Evaluate Division

Array String Depth-First Search Breadth-First Search Union-Find Graph Theory Shortest Path Bellman–Ford Algorithm Floyd–Warshall Algorithm

#11

Rank

#960HardFrequency: 66.4%

Minimize Malware Spread

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory

#12

Rank

#1661MediumFrequency: 65.5%

Minimum Number of Vertices to Reach All Nodes

Graph Theory Directed Acyclic Graph

#13

Rank

#803MediumFrequency: 65.5%

Cheapest Flights Within K Stops

Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#14

Rank

#3627MediumFrequency: 65.4%

Find Minimum Time to Reach Last Room I

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#15

Rank

#3863MediumFrequency: 64.9%

Power Grid Maintenance

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory Heap (Priority Queue)Ordered Set

#16

Rank

#3881MediumFrequency: 61.5%

Minimize Maximum Component Cost

Binary Search Union-Find Graph Theory Sorting

#17

Rank

#2583HardFrequency: 57.5%

Divide Nodes Into the Maximum Number of Groups

Depth-First Search Breadth-First Search Union-Find Graph Theory

#18

Rank

#922MediumFrequency: 54.4%

Possible Bipartition

Depth-First Search Breadth-First Search Union-Find Graph Theory Graph Coloring Bipartite Graph

#19

Rank

#3613MediumFrequency: 54.1%

Maximize Amount After Two Days of Conversions

Array String Depth-First Search Breadth-First Search Graph Theory

#20

Rank

#505MediumFrequency: 54.1%

The Maze II

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#21

Rank

#3271MediumFrequency: 53.4%

Count the Number of Houses at a Certain Distance I

Breadth-First Search Graph Theory Prefix Sum

#22

Rank

#3310HardFrequency: 53.4%

Count the Number of Houses at a Certain Distance II

Graph Theory Prefix Sum

#23

Rank

#1431MediumFrequency: 53.4%

All Ancestors of a Node in a Directed Acyclic Graph

Depth-First Search Breadth-First Search Graph Theory Topological Sort Directed Acyclic Graph

#24

Rank

#1300HardFrequency: 52.9%

Critical Connections in a Network

Asked at Flipkart

Depth-First Search Graph Theory Biconnected Component Bridge (Graph)

#25

Rank

#3628MediumFrequency: 52.1%

Find Minimum Time to Reach Last Room II

Array Graph Theory Heap (Priority Queue)Matrix Shortest Path

#26

Rank

#547MediumFrequency: 50.7%

Number of Provinces

Depth-First Search Breadth-First Search Union-Find Graph Theory

#27

Rank

#881MediumFrequency: 50.3%

Loud and Rich

Asked at PayPal

Array Depth-First Search Graph Theory Topological Sort Directed Acyclic Graph

#28

Rank

#1101MediumFrequency: 47.5%

Parallel Courses

Graph Theory Topological Sort Directed Acyclic Graph

#29

Rank

#1456MediumFrequency: 47.5%

Find the City With the Smallest Number of Neighbors at a Threshold Distance

Dynamic Programming Graph Theory Shortest Path Dijkstra's Algorithm Bellman–Ford Algorithm Floyd–Warshall Algorithm

#30

Rank

#1558MediumFrequency: 47.5%

Course Schedule IV

Depth-First Search Breadth-First Search Graph Theory Topological Sort

#31

Rank

#1701HardFrequency: 47.5%

Remove Max Number of Edges to Keep Graph Fully Traversable

Union-Find Graph Theory

#32

Rank

#1820HardFrequency: 47.5%

Number Of Ways To Reconstruct A Tree

Array Hash Table Tree Graph Theory Simulation

#33

Rank

#2065HardFrequency: 47.5%

Check for Contradictions in Equations

Array String Depth-First Search Union-Find Graph Theory

#34

Rank

#2364HardFrequency: 44.8%

Longest Path With Different Adjacent Characters

Array String Tree Depth-First Search Graph Theory Topological Sort

#35

Rank

#1485HardFrequency: 44.8%

Minimum Cost to Make at Least One Valid Path in a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#36

Rank

#261MediumFrequency: 44.7%

Graph Valid Tree

Asked at LinkedIn

Depth-First Search Breadth-First Search Union-Find Graph Theory

#37

Rank

#1706MediumFrequency: 44%

Min Cost to Connect All Points

Array Union-Find Graph Theory Minimum Spanning Tree Prim's Algorithm Kruskal's Algorithm Borůvka's Algorithm

#38

Rank

#1576MediumFrequency: 44%

Reorder Routes to Make All Paths Lead to the City Zero

Depth-First Search Breadth-First Search Graph Theory

#39

Rank

#332HardFrequency: 43.2%

Reconstruct Itinerary

Asked at Flipkart

Array String Depth-First Search Graph Theory Sorting Heap (Priority Queue)Eulerian Circuit Eulerian Path Semi-Eulerian Graph

#40

Rank

#2040HardFrequency: 43%

Minimum Cost to Reach Destination in Time

Asked at Databricks

Array Dynamic Programming Graph Theory Dijkstra's Algorithm

#41

Rank

#3825MediumFrequency: 42.7%

Apply Substitutions

Array Hash Table String Depth-First Search Breadth-First Search Graph Theory Topological Sort

#42

Rank

#323MediumFrequency: 42.2%

Number of Connected Components in an Undirected Graph

Asked at LinkedIn

Depth-First Search Breadth-First Search Union-Find Graph Theory

#43

Rank

#2717HardFrequency: 41.6%

Collect Coins in a Tree

Array Tree Graph Theory Topological Sort

#44

Rank

#744MediumFrequency: 41.2%

Network Delay Time

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#45

Rank

#1442MediumFrequency: 40.9%

Number of Operations to Make Network Connected

Asked at PayPal

Depth-First Search Breadth-First Search Union-Find Graph Theory

#46

Rank

#871MediumFrequency: 39.4%

Keys and Rooms

Asked at Apple

Depth-First Search Breadth-First Search Graph Theory

#47

Rank

#2220MediumFrequency: 39.1%

Find All Possible Recipes from Given Supplies

Array Hash Table String Graph Theory Topological Sort Directed Acyclic Graph

#48

Rank

#1177MediumFrequency: 39.1%

Tree Diameter

Tree Depth-First Search Breadth-First Search Graph Theory Topological Sort DP on Trees

#49

Rank

#2564MediumFrequency: 37.9%

Most Profitable Path in a Tree

Array Tree Depth-First Search Breadth-First Search Graph Theory

#50

Rank

#2206MediumFrequency: 36.9%

Detonate the Maximum Bombs

Array Math Depth-First Search Breadth-First Search Graph Theory Geometry

#51

Rank

#820MediumFrequency: 35.1%

Find Eventual Safe States

Depth-First Search Breadth-First Search Graph Theory Topological Sort Kosaraju's Algorithm Tarjan's SCC Algorithm

#52

Rank

#2189HardFrequency: 35%

Maximum Path Quality of a Graph

Asked at Apple

Array Backtracking Graph Theory

#53

Rank

#1916EasyFrequency: 34.3%

Find Center of Star Graph

#54

Rank

#801MediumFrequency: 34.2%

Is Graph Bipartite?

Depth-First Search Breadth-First Search Union-Find Graph Theory Graph Coloring Bipartite Graph

#55

Rank

#684MediumFrequency: 33.7%

Redundant Connection

Depth-First Search Breadth-First Search Union-Find Graph Theory

#56

Rank

#1613HardFrequency: 33.5%

Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Union-Find Graph Theory Sorting Minimum Spanning Tree Strongly Connected Component Prim's Algorithm Kruskal's Algorithm Borůvka's Algorithm

#57

Rank

#1347HardFrequency: 33.3%

Distance to a Cycle in Undirected Graph

Depth-First Search Breadth-First Search Graph Theory Topological Sort

#58

Rank

#1738MediumFrequency: 32.8%

Maximal Network Rank

#59

Rank

#2121EasyFrequency: 32.8%

Find if Path Exists in Graph

Depth-First Search Breadth-First Search Union-Find Graph Theory

#60

Rank

#3655MediumFrequency: 32.8%

Digit Operations to Make Two Integers Equal

Math Graph Theory Heap (Priority Queue)Number Theory Shortest Path

#61

Rank

#3838MediumFrequency: 32.4%

Path Existence Queries in a Graph I

Array Hash Table Binary Search Union-Find Graph Theory

#62

Rank

#444MediumFrequency: 31.8%

Sequence Reconstruction

Array Graph Theory Topological Sort Directed Acyclic Graph

#63

Rank

#863HardFrequency: 31.8%

Sum of Distances in Tree

Dynamic Programming Tree Depth-First Search Graph Theory DP on Trees

#64

Rank

#2321HardFrequency: 31.8%

Minimum Weighted Subgraph With the Required Paths

Graph Theory Heap (Priority Queue)Shortest Path

#65

Rank

#310MediumFrequency: 30.4%

Minimum Height Trees

Depth-First Search Breadth-First Search Graph Theory Topological Sort

#66

Rank

#877HardFrequency: 29.7%

Shortest Path Visiting All Nodes

Dynamic Programming Bit Manipulation Breadth-First Search Graph Theory Bitmask

#67

Rank

#2246HardFrequency: 29.3%

Maximum Employees to Be Invited to a Meeting

Array Dynamic Programming Depth-First Search Graph Theory Topological Sort Kosaraju's Algorithm Tarjan's SCC Algorithm

#68

Rank

#2568MediumFrequency: 29.3%

Minimum Fuel Cost to Report to the Capital

Tree Depth-First Search Breadth-First Search Graph Theory

#69

Rank

#984MediumFrequency: 29.1%

Most Stones Removed with Same Row or Column

Hash Table Depth-First Search Union-Find Graph Theory Bipartite Graph

#70

Rank

#2403MediumFrequency: 27.8%

Count Unreachable Pairs of Nodes in an Undirected Graph

Depth-First Search Breadth-First Search Union-Find Graph Theory

#71

Rank

#3386HardFrequency: 27.3%

Find Edges in Shortest Paths

Asked at DoorDash

Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Shortest Path

#72

Rank

#1959MediumFrequency: 26.7%

Minimum Path Cost in a Hidden Grid

Array Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Interactive Shortest Path

#73

Rank

#1229MediumFrequency: 26.5%

Shortest Path with Alternating Colors

Breadth-First Search Graph Theory

#74

Rank

#2353HardFrequency: 26.3%

Maximum Score of a Node Sequence

Array Graph Theory Sorting Enumeration

#75

Rank

#1325MediumFrequency: 25.4%

Path with Maximum Probability

Array Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#76

Rank

#3887MediumFrequency: 25.3%

Minimum Cost Path with Edge Reversals

Graph Theory Heap (Priority Queue)Shortest Path

#77

Rank

#3439HardFrequency: 25.3%

Find Minimum Diameter After Merging Two Trees

Tree Depth-First Search Breadth-First Search Graph Theory

#78

Rank

#813MediumFrequency: 25.1%

All Paths From Source to Target

Backtracking Depth-First Search Breadth-First Search Graph Theory Directed Acyclic Graph

#79

Rank

#1436MediumFrequency: 25.1%

Get Watched Videos by Your Friends

Array Hash Table Breadth-First Search Graph Theory Sorting

#80

Rank

#1275MediumFrequency: 25.1%

Validate Binary Tree Nodes

Tree Depth-First Search Breadth-First Search Union-Find Graph Theory Binary Tree

#81

Rank

#2176HardFrequency: 24.6%

Parallel Courses III

Array Dynamic Programming Graph Theory Topological Sort Directed Acyclic Graph

#82

Rank

#3752MediumFrequency: 24.6%

Unit Conversion II

Array Math Depth-First Search Breadth-First Search Graph Theory

#83

Rank

#1587HardFrequency: 24.4%

Parallel Courses II

Dynamic Programming Bit Manipulation Graph Theory Bitmask Directed Acyclic Graph

#84

Rank

#2213HardFrequency: 24.4%

Find All People With Secret

Depth-First Search Breadth-First Search Union-Find Graph Theory Sorting

#85

Rank

#2090MediumFrequency: 24.4%

Number of Ways to Arrive at Destination

Dynamic Programming Graph Theory Topological Sort Shortest Path Dijkstra's Algorithm

#86

Rank

#754HardFrequency: 23.3%

Cracking the Safe

String Depth-First Search Graph Theory Eulerian Circuit Eulerian Path Eulerian Graph

#87

Rank

#2375HardFrequency: 23.3%

Minimum Obstacle Removal to Reach Corner

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path 0-1 BFS Dijkstra's Algorithm

#88

Rank

#949HardFrequency: 22.1%

Cat and Mouse

Math Dynamic Programming Graph Theory Topological Sort Memoization Minimax Game Theory Zero-Sum Game

#89

Rank

#1257HardFrequency: 22.1%

Rank Transform of a Matrix

Array Union-Find Graph Theory Topological Sort Sorting Matrix

#90

Rank

#1815HardFrequency: 22.1%

Checking Existence of Edge Length Limited Paths

Array Two Pointers Union-Find Graph Theory Sorting

#91

Rank

#2505HardFrequency: 22.1%

Number of Good Paths

Array Hash Table Tree Union-Find Graph Theory Sorting

#92

Rank

#1144HardFrequency: 22%

Optimize Water Distribution in a Village

Asked at Apple

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree Prim's Algorithm Kruskal's Algorithm Borůvka's Algorithm

#93

Rank

#2590MediumFrequency: 21.9%

Maximum Star Sum of a Graph

Array Greedy Graph Theory Sorting Heap (Priority Queue)

#94

Rank

#1727HardFrequency: 20.9%

Cat and Mouse II

Array Math Dynamic Programming Graph Theory Topological Sort Memoization Minimax Matrix Game Theory Zero-Sum Game

#95

Rank

#1912MediumFrequency: 20.9%

Number of Restricted Paths From First to Last Node

Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#96

Rank

#1986HardFrequency: 20.9%

Largest Color Value in a Directed Graph

Hash Table String Dynamic Programming Graph Theory Topological Sort Memoization Counting Directed Acyclic Graph

#97

Rank

#2472HardFrequency: 20.9%

Build a Matrix With Conditions

Array Graph Theory Topological Sort Matrix Directed Acyclic Graph

#98

Rank

#685HardFrequency: 20.9%

Redundant Connection II

Depth-First Search Breadth-First Search Union-Find Graph Theory

#99

Rank

#964HardFrequency: 20.3%

Minimize Malware Spread II

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory

#100

Rank

#2198HardFrequency: 20.3%

Process Restricted Friend Requests

Union-Find Graph Theory

#101

Rank

#3720MediumFrequency: 20.3%

Minimize the Maximum Edge Weight of Graph

Binary Search Depth-First Search Breadth-First Search Graph Theory Shortest Path

#102

Rank

#1100MediumFrequency: 20%

Connecting Cities With Minimum Cost

Union-Find Graph Theory Heap (Priority Queue)Minimum Spanning Tree

#103

Rank

#1887HardFrequency: 20%

Minimum Degree of a Connected Trio in a Graph

Graph Theory Enumeration

#104

Rank

#1891HardFrequency: 20%

Count Pairs Of Nodes

Array Hash Table Two Pointers Binary Search Graph Theory Sorting Counting

#105

Rank

#2056MediumFrequency: 20%

Jump Game VIII

Array Dynamic Programming Stack Graph Theory Monotonic Stack Shortest Path

#106

Rank

#2259HardFrequency: 20%

Minimum Operations to Remove Adjacent Ones in Matrix

Array Depth-First Search Graph Theory Matrix Edmonds–Karp Algorithm MPM Algorithm Push-Relabel Algorithm Flow Network Dinic's Algorithm

#107

Rank

#511MediumFrequency: 19.5%

All Paths from Source Lead to Destination

Graph Theory Topological Sort Kosaraju's Algorithm Tarjan's SCC Algorithm

#108

Rank

#1039EasyFrequency: 19.5%

Find the Town Judge

Array Hash Table Graph Theory

#109

Rank

#3189MediumFrequency: 19.5%

Find Champion II

#110

Rank

#770HardFrequency: 19.5%

Couples Holding Hands

Greedy Depth-First Search Breadth-First Search Union-Find Graph Theory

#111

Rank

#1696HardFrequency: 18%

Strange Printer II

Array Graph Theory Topological Sort Matrix Directed Acyclic Graph

#112

Rank

#1124HardFrequency: 16.4%

String Transforms Into Another String

Hash Table String Graph Theory

#113

Rank

#1687HardFrequency: 16.4%

The Most Similar Path in a Graph

Array String Dynamic Programming Graph Theory

#114

Rank

#1865HardFrequency: 16.4%

Checking Existence of Edge Length Limited Paths II

Depth-First Search Union-Find Graph Theory Design Sorting Heap (Priority Queue)Minimum Spanning Tree

#115

Rank

#2218MediumFrequency: 16.4%

Paths in Maze That Lead to Same Room

#116

Rank

#2506HardFrequency: 16.4%

Minimize Maximum Value in a Grid

Array Union-Find Graph Theory Topological Sort Sorting Matrix

#117

Rank

#1493HardFrequency: 16.4%

Frog Position After T Seconds

Tree Depth-First Search Breadth-First Search Graph Theory

#118

Rank

#3348HardFrequency: 16.4%

Minimum Cost Walk in Weighted Graph

Array Bit Manipulation Union-Find Graph Theory

#119

Rank

#3517MediumFrequency: 16.1%

Shortest Distance After Road Addition Queries I

Array Breadth-First Search Graph Theory

#120

Rank

#2711HardFrequency: 16.1%

Minimum Time to Visit a Cell In a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#121

Rank

#2793MediumFrequency: 16.1%

Count the Number of Complete Components

Depth-First Search Breadth-First Search Union-Find Graph Theory

#122

Rank

#1032MediumFrequency: 14.6%

Satisfiability of Equality Equations

Array String Union-Find Graph Theory

#123

Rank

#3558MediumFrequency: 14.6%

Find a Safe Walk Through a Grid

Array Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path

#124

Rank

#2582MediumFrequency: 14.6%

Minimum Score of a Path Between Two Cities

Depth-First Search Breadth-First Search Union-Find Graph Theory

#125

Rank

#3852HardFrequency: 14.6%

Path Existence Queries in a Graph II

Array Two Pointers Binary Search Dynamic Programming Greedy Bit Manipulation Graph Theory Sorting

#126

Rank

#2438MediumFrequency: 13.2%

Find Closest Node to Given Two Nodes

Depth-First Search Graph Theory

#127

Rank

#2171HardFrequency: 12.6%

Second Minimum Time to Reach Destination

Breadth-First Search Graph Theory Shortest Path Dijkstra's Algorithm K Shortest Path

#128

Rank

#2409HardFrequency: 12%

Number of Increasing Paths in a Grid

Array Dynamic Programming Depth-First Search Breadth-First Search Graph Theory Topological Sort Memoization Matrix

#129

Rank

#3235MediumFrequency: 10.3%

Minimum Cost to Convert String I

Array String Graph Theory Shortest Path

#130

Rank

#3919HardFrequency: 10.3%

Network Recovery Pathways

Array Binary Search Dynamic Programming Graph Theory Topological Sort Heap (Priority Queue)Shortest Path

#131

Rank

#1309HardFrequency: 8.1%

Sort Items by Groups Respecting Dependencies

Depth-First Search Breadth-First Search Graph Theory Topological Sort Directed Acyclic Graph

#132

Rank

#3902HardFrequency: 8.1%

Maximize Spanning Tree Stability with Upgrades

Binary Search Greedy Union-Find Graph Theory Minimum Spanning Tree

#133

Rank

#2671HardFrequency: 8%

Shortest Cycle in a Graph

Breadth-First Search Graph Theory

#134

Rank

#3238HardFrequency: 7.3%

Minimum Cost to Convert String II

Array String Dynamic Programming Graph Theory Trie Shortest Path

#135

Rank

#2439HardFrequency: 7.3%

Longest Cycle in a Graph

Depth-First Search Breadth-First Search Graph Theory Topological Sort Kosaraju's Algorithm Tarjan's SCC Algorithm

#136

Rank

#3561MediumFrequency: 7.2%

Remove Methods From Project

Depth-First Search Breadth-First Search Graph Theory

#137

Rank

#1969MediumFrequency: 5.5%

Maximum Number of Accepted Invitations

Array Depth-First Search Graph Theory Matrix Maximum Flow Maximum Matching Bipartite Graph Edmonds–Karp Algorithm MPM Algorithm Push-Relabel Algorithm Matching (Graph)Flow Network Dinic's Algorithm

#138

Rank

#2803HardFrequency: 5.5%

Modify Graph Edge Weights

Graph Theory Heap (Priority Queue)Shortest Path

#139

Rank

#499HardFrequency: 5%

The Maze III

Array String Depth-First Search Breadth-First Search Graph Theory Heap (Priority Queue)Matrix Shortest Path Dijkstra's Algorithm Heuristic Search A* Search

#140

Rank

#2445MediumFrequency: 5%

Reachable Nodes With Restrictions

Array Hash Table Tree Depth-First Search Breadth-First Search Union-Find Graph Theory

#141

Rank

#4035HardFrequency: 5%

Maximum Partition Factor

Array Binary Search Depth-First Search Breadth-First Search Union-Find Graph Theory

#142

Rank

#2201HardFrequency: 5%

Valid Arrangement of Pairs

Array Depth-First Search Graph Theory Eulerian Circuit Eulerian Path Semi-Eulerian Graph

#143

Rank

#3930HardFrequency: 5%

Longest Palindromic Path in Graph

String Dynamic Programming Bit Manipulation Graph Theory Bitmask

#144

Rank

#918HardFrequency: 5%

Reachable Nodes In Subdivided Graph

Graph Theory Heap (Priority Queue)Shortest Path Dijkstra's Algorithm

#145

Rank

#3908MediumFrequency: 5%

Minimum Time for K Connected Components

Binary Search Union-Find Graph Theory Sorting

#146

Rank

#2151MediumFrequency: 5%

The Time When the Network Becomes Idle

Array Breadth-First Search Graph Theory

#147

Rank

#3809MediumFrequency: 5%

Properties Graph

Array Hash Table Depth-First Search Breadth-First Search Union-Find Graph Theory

#148

Rank

#3976HardFrequency: 5%

Minimum Cost to Buy Apples II