Question Details
Problem Find the shortest path between two nodes in a graph, using BFS for unweighted or Dijkstra for weighted graphs. Likely LeetCode equivalent LC 743 (Network Delay Time) or LC 1091 (Shortest Path in Binary Matrix). Tags graph, BFS, shortest-path
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Graph
Phone
Coding
More from Verkada
1p3a
Verkada Store Front Tech Phone Screen Interview Experience
LeetCode
#986 Interval List Intersections
InterviewDB
Camera API: Design an OOP Camera Control API for a Multi-Camera System
InterviewDB
Camera Intensity: Compute Pixel Intensity Statistics Across a Camera Feed
1p3a
Verkada Tech Phone Screen: Camera Failure Aggregation Problem