All Problems

169 problems total

Filter by Difficulty:

Tag:

Company:

Active filters:Category: Graph Theory×
TitleDifficultyVideosCompanies
Apply Substitutionsmedium-
Check if words chain to form a circlemedium-
Digit Operations to Make Two Integers Equalmedium-
Find if there is a path between two vertices in a directed grapheasy-
Frequencies of Shortest Supersequenceshard-
Maximize Amount After Two Days of Conversionsmedium-
Maximum Profit from Valid Topological Order in DAGhard-
Maximum Sum of Edge Values in a Graphhard-
Maximum Weighted K-Edge Pathmedium-
Minimize the Maximum Edge Weight of Graphmedium-
Minimum Cost to Make at Least One Valid Path in a Gridhard-
Minimum Runes to Add to Cast Spellhard-
Minimum Time to Break Locks IIhard-
Number of Restricted Paths From First to Last Nodemedium-
Path Existence Queries in a Graph Imedium-
Path Existence Queries in a Graph IIhard-
Properties Graphmedium-
Unit Conversion Imedium-
Unit Conversion IImedium-
Clone Undirected Graphmedium
Course Schedule 1 - Is it Possiblemedium
Course Schedule 2 - Get Ordered Coursesmedium-
Graph Valid Treemedium-
Alien Dictionaryhard-
Find the Celebritymedium-
Minimum Height Treesmedium-
Number of Connected Components in an Undirected Graphmedium-
Longest Increasing Path in a Matrixhard-
Reconstruct Itineraryhard-
Evaluate Divisionmedium-
Sequence Reconstructionmedium-
The Maze 3 - Shortest Instructions to Reach the Holehard-
The Maze 2 - Shortest Distancemedium-
Number of Provincesmedium-
Design Excel Sum Formulahard-
Redundant Connectionmedium-
Redundant Connection IIhard-
Network Delay Timemedium-
Cracking the Safehard-
Couples Holding Handshard-
Is Graph Bipartitemedium-
Cheapest Flights Within K Stops Problemmedium-
All Paths from Source to Targetmedium-
Find Eventual Safe Statesmedium-
Sum of Distances in Treehard-
Keys and Roomsmedium-
Shortest Path Visiting All Nodeshard-
Loud and Richmedium-
Reachable Nodes In Subdivided Graphhard-
Possible Bipartitionmedium-
Showing 1 to 50 of 169 results