Given a tree, you must find all root-to-leaf paths using DFS and BFS. Track path lists during traversal. DFS uses recursion, and BFS uses a queue storing nodes with current path arrays.
The following metrics were computed from 9 interview experiences for the FireworksAI Software Engineer role.
FireworksAI's interview process for their Software Engineer roles is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for FireworksAI's Software Engineer interview process.