Problems
Topics
Tags
Progress
Search
Open user menu
Open main menu
Home
|
Tag
|
BFS
Problems with tag
BFS
73 found, showing 1 to 30
1
2
3
;
Alien Dictionary
->
Hard,
#269,
3 solutions
All Ancestors of a Node in a Directed Acyclic Graph
->
Medium,
#2192,
2 solutions
Amount of Time for Binary Tree to Be Infected
->
Medium,
#2385,
2 solutions
Binary Tree Level Order Traversal II
->
Medium,
#107,
4 solutions
Binary Tree Level Order Traversal
->
Medium,
#102,
6 solutions
Binary Tree Vertical Order Traversal
->
Medium,
#314,
2 solutions
Binary Tree Zigzag Level Order Traversal
->
Medium,
#103,
5 solutions
Check Completeness of a Binary Tree
->
Medium,
#958,
3 solutions
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
->
Medium,
#1430,
2 solutions
Clone Graph
->
Medium,
#133,
4 solutions
Closest Node to Path in Tree
->
Hard,
#2277,
2 solutions
Collect Coins in a Tree
->
Hard,
#2603,
2 solutions
Correct a Binary Tree
->
Medium,
#1660,
2 solutions
Count Pairs of Connectable Servers in a Weighted Tree Network
->
Medium,
#3067,
2 solutions
Count the Number of Complete Components
->
Medium,
#2685,
2 solutions
Count Unreachable Pairs of Nodes in an Undirected Graph
->
Medium,
#2316,
2 solutions
Create Components With Same Value
->
Hard,
#2440,
2 solutions
Detect Cycles in 2D Grid
->
Medium,
#1559,
2 solutions
Detonate the Maximum Bombs
->
Medium,
#2101,
2 solutions
Distance to a Cycle in Undirected Graph
->
Hard,
#2204,
2 solutions
Divide Nodes Into the Maximum Number of Groups
->
Hard,
#2493,
2 solutions
Employee Importance
->
Medium,
#690,
2 solutions
Escape the Spreading Fire
->
Hard,
#2258,
2 solutions
Evaluate Division
->
Medium,
#399,
3 solutions
Find All People With Secret
->
Hard,
#2092,
2 solutions
Find Bottom Left Tree Value
->
Medium,
#513,
3 solutions
Find if Path Exists in Graph
->
Easy,
#1971,
2 solutions
Find the K-Sum of an Array
->
Hard,
#2386,
2 solutions
Cousins in Binary Tree II
->
Medium,
#2641,
2 solutions
Find the Connected Component in the Undirected Graph
->
Medium,
#431,
1 solutions