All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Back to Amazon Problems
easyLinked Lists
Merge Two Sorted Lists
Description
You are given the heads of two sorted linked lists list1 and list2.
Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.
Return the head of the merged linked list.
Constraints
- The number of nodes in both lists is in the range [0, 50].
- -100 <= Node.val <= 100
- Both list1 and list2 are sorted in non-decreasing order.
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