Cadence·AI Engineer·Technical Phone Screen
Mar 2026
Live coding round at Cadence for an AI Engineer role, one problem, graph traversal. Pretty standard stuff but they pushed on implementation details more than I expected.
- Given an undirected graph with n nodes (labeled 0 to n-1) and a list of edges, write a function that returns the number of connected components.
“Built the adjacency list first, then looped over nodes and ran DFS from any unvisited one.” The rest of the author's notes on AI Engineer interview at Cadence, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post