Back to sheet
Product Companies SDE-1 Sheet
Stack, Queue & Linked List
8 problems
problem
Topic Progress0 / 8 solved
Problem List
Work through the problems in sequence to build topic mastery.
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Valid Parentheses | Medium | Unsolved | Required | |
| Min Stack | Medium | Unsolved | Required | |
| Evaluate Reverse Polish Notation | Medium | Unsolved | Required | |
| Implement Queue Using Stacks | Medium | Unsolved | Required | |
| Reverse Linked List | Medium | Unsolved | Required | |
| Merge Two Sorted Lists | Medium | Unsolved | Required | |
| Linked List Cycle | Medium | Unsolved | Required | |
| Middle Of The Linked List | Medium | Unsolved | Required |
Topic Snapshot
A compact summary of what this sheet section covers and how far you have progressed.
Stack, Queue & Linked List
Cover the stateful structures that test clean pointer updates, stack invariants, and queue simulation.
sde-1
product-companies
Completion
0%
Problems Remaining
8
Optional Problems
0
Complete the required items first, then use optional problems for extra depth.