Validate graph symmetric
Last updated: August 10, 2025
Quick Overview
Given an undirected graph represented as an adjacency list, write a function to determine if the graph is symmetric, meaning that for every edge (u, v), there is a corresponding edge (v, u). The function should return a boolean value indicating whether the graph is symmetric or not.
CrowdStrike
August 10, 20254
8
1,241 solved
Given an undirected graph represented as an adjacency list, write a function to determine if the graph is symmetric, meaning that for every edge (u, v), there is a corresponding edge (v, u). The function should return a boolean value indicating whether the graph is symmetric or not.
Coding interviews at CrowdStrike focus on problem-solving approach as much as the final solution. The interviewer wants to see you break down the problem, consider edge cases, and optimize iteratively. Communication throughout the process is key.
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 happens if the input contains duplicates?
- Can you solve this iteratively instead of recursively (or vice versa)?
- How would you test this solution thoroughly?
- How would you parallelize this 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
To determine if an undirected graph is symmetric, we need to check if for every edge (u, v) in the graph, the reverse edge (v, u) also exists. This is a clear application of a graph traversal techniqu...
Approach
- Initialize a dictionary to represent the adjacency list of the graph.
- For each node in the graph, iterate through its neighbors.
- For each edge (u, v), check if v is in the adjacency list ...
Submit Your Answer
