All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Back to Meta Problems
mediumGraphs
Clone Graph
Description
Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph.
Each node in the graph contains a value (int) and a list (List[Node]) of its neighbors.
Constraints
- The number of nodes in the graph is in the range [0, 100].
- 1 <= Node.val <= 100
- Node.val is unique for each node.
Code Editor Coming Soon!In Progress
We're building something amazing
Multi-language support (C++, Python, Java, JavaScript)
Real-time code execution with test cases
Syntax highlighting & auto-completion
Save your solutions automatically
Compare with optimal solutions
Development Progress65%
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Timer
0:00
Ready to start
Try to solve within 30-45 minutes. Good interview practice!
Problem Stats
Acceptance Rate68.4%
Total Solved1,245
Average Time25 mins
Your StatusNot Attempted