Problems Topics Tags Progress

Search

Home

|

Tag

|

DFS

Problems with tag DFS

125 found, showing 30 to 60

2

;

Create Components With Same Value ->

Hard, #2440, 2 solutions

Deep Merge of Two Objects ->

Medium, #2755, 1 solutions

Deep Object Filter ->

Medium, #2823, 1 solutions

Delete Duplicate Folders in System ->

Hard, #1948, 2 solutions

Delete Leaves With a Given Value ->

Medium, #1325, 2 solutions

Delete Tree Nodes ->

Medium, #1273, 2 solutions

Detect Pattern of Length M Repeated K or More Times ->

Easy, #1566, 2 solutions

Diameter of N-Ary Tree ->

Medium, #1522, 2 solutions

Detonate the Maximum Bombs ->

Medium, #2101, 2 solutions

Difference Between Maximum and Minimum Price Sum ->

Hard, #2538, 2 solutions

Disconnect Path in a Binary Matrix by at Most One Flip ->

Medium, #2556, 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

Find All People With Secret ->

Hard, #2092, 2 solutions

Find All The Lonely Nodes ->

Easy, #1469, 2 solutions

Find Bottom Left Tree Value ->

Medium, #513, 3 solutions

Find Closest Node to Given Two Nodes ->

Medium, #2359, 2 solutions

Find Duplicate Subtrees ->

Medium, #652, 3 solutions

Differences Between Two Objects ->

Medium, #2700, 1 solutions

Find Elements in a Contaminated Binary Tree ->

Medium, #1261, 2 solutions

Find if Path Exists in Graph ->

Easy, #1971, 2 solutions

Find Number of Coins to Place in Tree Nodes ->

Hard, #2973, 2 solutions

Flatten Deeply Nested Array ->

Medium, #2625, 1 solutions

Flip Binary Tree To Match Preorder Traversal ->

Medium, #971, 3 solutions

Flip Equivalent Binary Trees ->

Medium, #951, 4 solutions

Evaluate Boolean Binary Tree ->

Easy, #2331, 2 solutions

Distribute Coins in Binary Tree ->

Medium, #979, 3 solutions

Frog Position After T Seconds ->

Hard, #1377, 2 solutions

Height of Binary Tree After Subtree Removal Queries ->

Hard, #2458, 2 solutions