Problems Topics Tags Progress

Search

Home

|

Tag

|

BFS

Problems with tag BFS

73 found, showing 30 to 60

2

;

Find the Level of Tree with Minimum Sum ->

Medium, #3157, 2 solutions

Find the Safest Path in a Grid ->

Medium, #2812, 2 solutions

Greatest Common Divisor Traversal ->

Hard, #2709, 2 solutions

Jump Game VII ->

Medium, #1871, 3 solutions

K Highest Ranked Items Within a Price Range ->

Medium, #2146, 2 solutions

Kill Process ->

Medium, #582, 2 solutions

Frog Position After T Seconds ->

Hard, #1377, 2 solutions

Longest Path With Different Adjacent Characters ->

Hard, #2246, 2 solutions

Height of Special Binary Tree ->

Medium, #2773, 2 solutions

Map of Highest Peak ->

Medium, #1765, 3 solutions

Lexicographically Smallest String After Applying Operations ->

Medium, #1625, 3 solutions

Maximum Cost of Trip With K Highways ->

Hard, #2247, 2 solutions

Maximum Hamming Distances ->

Hard, #3141, 2 solutions

Kth Largest Sum in a Binary Tree ->

Medium, #2583, 2 solutions

Maximum Number of Points From Grid Queries ->

Hard, #2503, 2 solutions

Merge BSTs to Create Single BST ->

Hard, #1932, 2 solutions

Maximum Number of Fish in a Grid ->

Medium, #2658, 2 solutions

Maximum Number of K-Divisible Components ->

Hard, #2872, 2 solutions

Minimum Number of Operations to Sort a Binary Tree by Level ->

Medium, #2471, 2 solutions

Maximum Number of Moves in a Grid ->

Medium, #2684, 2 solutions

Minimum Reverse Operations ->

Hard, #2612, 2 solutions

Minimum Score of a Path Between Two Cities ->

Medium, #2492, 2 solutions

Minimum Number of Operations to Make X and Y Equal ->

Medium, #2998, 2 solutions

Minimum Jumps to Reach Home ->

Medium, #1654, 2 solutions

Minimum Time Takes to Reach Destination Without Drowning ->

Hard, #2814, 2 solutions

Number of Nodes With Value One ->

Medium, #2445, 2 solutions

Reachable Nodes With Restrictions ->

Medium, #2368, 2 solutions

Number of Islands ->

Medium, #200, 6 solutions

Minimum Number of Visited Cells in a Grid ->

Hard, #2617, 2 solutions

Path With Minimum Effort ->

Medium, #1631, 2 solutions