The Augmented Dev · Archive
Dynamics 365, Power Platform, AI, system design, and web development — filter by theme or search across every post.
Newsletter
One email per post. No spam, no tracking pixels, unsubscribe anytime.
11 of 325 articles tagged tree-bfs
Replace the level list with a running sum — the aggregation variant. Python solution and complexity analysis for the BFS interview pattern.
Bottom-up levels — resist cleverness, reverse at the end. Python solution and complexity analysis for the BFS interview pattern.
The level-snapshot queue loop that eight other questions reuse verbatim. Python solution and complexity analysis for the BFS interview pattern.
What you see from the right — take each level's final node. Python solution and complexity analysis for the BFS interview pattern.
Alternate level direction with a flag — never touch the queue order. Python solution and complexity analysis for the BFS interview pattern.
Track depth and parent per node — two facts decide cousinhood. Python solution and complexity analysis for the BFS interview pattern.
First leaf wins — early exit that full-tree DFS cannot match. Python solution and complexity analysis for the BFS interview pattern.
Wire each node to its right neighbor using the wires you just installed. Python solution and complexity analysis for the BFS interview pattern.
Seed the queue with every rotten orange — simultaneous spread, counted in rounds. Python solution and complexity analysis for the BFS interview pattern.
Unweighted shortest path — BFS by definition, eight neighbors, mark early. Python solution and complexity analysis for the BFS interview pattern.
Shortest transformation via wildcard buckets, not pairwise comparison. Python solution and complexity analysis for the BFS interview pattern.
