#dfs

Build, validate and prune a computation graph
CodingMediumNvidia
▲ 00 solutions
Mini spreadsheet with formulas and cycle detection
CodingHardHarveyOpenAICharacter.AIAmazon
▲ 01 solution
Word search with a word search II follow-up
CodingHardGleanAmazonSnowflakeUber
▲ 01 solution
Shipping route cost paths
CodingMediumStripe
▲ 01 solution
Palindromic paths from a node to the root
CodingHardUber
▲ 01 solution
Peel an N-ary tree one leaf layer per day
CodingMediumGoogle
▲ 01 solution
Minimum starting vertices to reach a cyclic directed graph
CodingHardAirbnb
▲ 01 solution
Minimum root-to-leaf path sum
CodingMediumMetaTesla
▲ 01 solution
Merge two n-ary trees by child position
CodingMediumMicrosoft
▲ 01 solution
Maximum path sum between two leaves of a binary tree
CodingEasyGoogle
▲ 01 solution
Limit tree height by deleting nodes
CodingMediumSnowflake
▲ 01 solution
Root of the largest tree in a forest
CodingMediumGoogleMicrosoft
▲ 01 solution
Root-started value path in an N-ary tree
CodingMediumAmazon
▲ 01 solution
Lowest common manager in an org chart
CodingMediumAmazon
▲ 01 solution
Inherited permissions across teams, folders and files
CodingMediumFigma
▲ 01 solution
Unix find command with pluggable filters
CodingHardGoogleAmazon
▲ 01 solution
Compress an n-ary tree by promoting children
CodingMediumAmazonMicrosoftMeta
▲ 01 solution
Minimum distance between two nodes in an N-ary tree
CodingMediumScale AIGoogle
▲ 01 solution
Minimum-cost encryption of a directory tree
CodingMediumDatabricks
▲ 01 solution