multi-source Interview Questions

Reported from an Uber backend screening interview, this puzzle requires updating a 2D board filled with symbols and blank slots by expanding valid characters into their immediate orthogonal neighbors. The secondary objective involves tie-breaking mechanisms based on alphabetical priority when multiple options are equidistant. This scenario tests your grasp of multi-source breadth-first search patterns and grid traversal algorithms. Unlock the complete problem specification and model solution by purchasing a subscription.

Reported as a classic DoorDash coding interview challenge, this grid-based problem tests your mastery of multi-source breadth-first search algorithms. Candidates must calculate shortest path distances across a spatial map filled with walkable regions, barriers, and target destinations while carefully handling reachability constraints and obstacle interactions. The task emphasizes optimal graph traversal techniques and precise matrix manipulation. Unlock the full problem details, algorithmic approach, and clean production-ready code by obtaining a subscription.

This Meta interview question explores dual matrix traversal techniques, combining shortest path determinations and connected component measurements. You will work with two-dimensional grids to compute spatial distances from specific markers or measure the extent of contiguous regions using graph search algorithms like breadth-first or depth-first search. The problem tests your spatial reasoning, matrix manipulation skills, and optimization strategies for grid-based data structures. Explore the complete problem overview and comprehensive solution by purchasing a subscription.

This classic grid-based simulation problem, frequently featured in Uber technical interviews, tests your proficiency with breadth-first search algorithms. You are given a matrix representing empty spaces, fresh produce, and spoiled items, where contamination spreads to adjacent cells at each time step. The goal is to determine the total duration needed to infect all reachable targets or identify if complete contamination is impossible. Unlocking the full problem description, algorithmic breakdown, and optimal code solution requires a subscription.