Given a tree, find all root-to-leaf paths using DFS and BFS. Track path lists during traversal; DFS uses recursion, BFS uses queue storing nodes with current path arrays.Given a tree, find all root-to-leaf paths using DFS and BFS. Track path lists during traversal; DFS uses recursion, BFS uses queue storing nodes with current path arrays.
Altre recensioni di colloqui per Software Engineer presso Fireworks AI
Seems like a small close knit team with smart peers and good technical work. Had a couple of system design and coding questions. Culture can be fast paced and intense for some.
Just finished a smooth Fireworks AI interview! High-bar, technical, and fast-paced, focusing on kernel optimization and LLM inference. Incredible team culture—definitely an exciting place for AI infra engineers to work.