Transform matrix to adjacency list
Last updated: September 4, 2025
Quick Overview
Given a matrix representation of a graph where each element indicates the presence of an edge between nodes, transform this matrix into an adjacency list format. The input will be a 2D array where the value at matrix[i][j] is 1 if there is an edge from node i to node j, and 0 otherwise. The output should be a list of lists, where each sublist contains the neighbors of the corresponding node.
Workday
September 4, 202544
14
4,252 solved
Given a matrix representation of a graph where each element indicates the presence of an edge between nodes, transform this matrix into an adjacency list format. The input will be a 2D array where the value at matrix[i][j] is 1 if there is an edge from node i to node j, and 0 otherwise. The output should be a list of lists, where each sublist contains the neighbors of the corresponding node.
Workday uses this problem in the Technical Screen to evaluate your algorithmic thinking. They expect you to discuss multiple approaches, analyze trade-offs between them, and implement the optimal solution with clean, readable code.
What the Interviewer Expects
- Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
- Discuss multiple approaches and trade-offs before coding
- Implement an optimal solution with clean, production-quality code
- Handle all edge cases including boundary conditions and invalid input
- Optimize both time and space complexity with clear justification
- Test your solution systematically with well-chosen examples
Key Topics to Cover
How to Approach This
- Clarify input constraints and edge cases before writing code.
- Walk through your approach verbally and confirm with the interviewer before coding.
- Start with a brute force solution, then optimize. Mention time and space complexity.
- Test your solution with examples, including edge cases like empty input or duplicates.
- Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
- What is the worst-case input for your solution?
- How would your solution change if the input was sorted?
- Can you optimize the space complexity of your solution?
Sharpen Your Skills on Codemia
Practice similar problems with our interactive workspace, get AI feedback, and track your progress.
Practice DSA ProblemsSample Answer
Problem Analysis
The problem involves transforming a matrix representation of a graph into an adjacency list. The matrix is a 2D array where a value of 1 at position matrix[i][j] indicates an edge from node i to...
Approach
- Initialize an empty list
adjacency_listto store the neighbors for each node. - Loop through each row
iof the matrix (representing each node). - For each row, loop through each column
jof...
Submit Your Answer
