Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Striver · takeUforward
Striver’s SDE Sheet (Classic)
The classic topic-wise SDE interview sheet, preserved separately from the newer SDE Pattern Sheet.
182 practice entries
0 / 182 completed0%
Day 1 — Arrays
0 / 6
Day 2 — Arrays Part II
0 / 6
Day 3 — Arrays Part III
0 / 6
Day 4 — Arrays Part IV
0 / 6
Day 5 — Linked List
0 / 6
Day 6 — Linked List Part II
0 / 7
Day 7 — Linked List & Arrays
0 / 5
Day 8 — Greedy
0 / 6
Day 9 — Recursion
0 / 6
Day 10 — Recursion & Backtracking
0 / 6
Day 11 — Binary Search
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Sqrt(x) | Easy | Open ↗ | — | |
| Kth Smallest Element in a Sorted Matrix | Medium | Open ↗ | — | |
| Single Element in a Sorted Array | Medium | Open ↗ | — | |
| Search in Rotated Sorted Array | Medium | Open ↗ | — | |
| Median of Two Sorted Arrays | Hard | Open ↗ | — | |
| Split Array Largest Sum | Hard | Open ↗ | — | |
| Magnetic Force Between Two Balls | Medium | Open ↗ | — | |
| Koko Eating Bananas | Medium | Open ↗ | — |
Day 12 — Heaps
0 / 6
Day 13 — Stack & Queue
0 / 7
Day 14 — Stack & Queue Part II
0 / 9
Day 15 — Strings
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Reverse Words in a String | Medium | Open ↗ | — | |
| Longest Palindromic Substring | Medium | Open ↗ | — | |
| Roman to Integer | Easy | Open ↗ | — | |
| Integer to Roman | Medium | Open ↗ | — | |
| String to Integer (atoi) | Medium | Open ↗ | — | |
| Longest Common Prefix | Easy | Open ↗ | — | |
| Find the Index of the First Occurrence in a String | Easy | Open ↗ | — |
Day 16 — Strings Part II
0 / 6
Day 17 — Binary Tree
0 / 6
Day 18 — Binary Tree Part II
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Binary Tree Level Order Traversal | Medium | Open ↗ | — | |
| Maximum Depth of Binary Tree | Easy | Open ↗ | — | |
| Diameter of Binary Tree | Easy | Open ↗ | — | |
| Balanced Binary Tree | Easy | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Tree | Medium | Open ↗ | — | |
| Same Tree | Easy | Open ↗ | — | |
| Binary Tree Zigzag Level Order Traversal | Medium | Open ↗ | — |
Day 19 — Binary Tree Part III
0 / 6
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Binary Tree Maximum Path Sum | Hard | Open ↗ | — | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Open ↗ | — | |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | Open ↗ | — | |
| Symmetric Tree | Easy | Open ↗ | — | |
| Flatten Binary Tree to Linked List | Medium | Open ↗ | — | |
| Path Sum | Easy | Open ↗ | — |
Day 20 — Binary Search Tree
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Populating Next Right Pointers in Each Node | Medium | Open ↗ | — | |
| Search in a Binary Search Tree | Easy | Open ↗ | — | |
| Convert Sorted Array to Binary Search Tree | Easy | Open ↗ | — | |
| Construct Binary Search Tree from Preorder Traversal | Medium | Open ↗ | — | |
| Validate Binary Search Tree | Medium | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Search Tree | Medium | Open ↗ | — | |
| Inorder Successor in BST | Medium | Open ↗ | — |
Day 21 — Binary Search Tree Part II
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Closest Binary Search Tree Value | Easy | Open ↗ | — | |
| Kth Smallest Element in a BST | Medium | Open ↗ | — | |
| Two Sum IV - Input is a BST | Easy | Open ↗ | — | |
| Binary Search Tree Iterator | Medium | Open ↗ | — | |
| Largest BST Subtree | Medium | Open ↗ | — | |
| Serialize and Deserialize Binary Tree | Hard | Open ↗ | — | |
| Delete Node in a BST | Medium | Open ↗ | — | |
| Trim a Binary Search Tree | Medium | Open ↗ | — |
Day 22 — Trees Miscellaneous
0 / 5
Day 23 — Graph
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Clone Graph | Medium | Open ↗ | — | |
| Number of Islands | Medium | Open ↗ | — | |
| Course Schedule | Medium | Open ↗ | — | |
| Course Schedule II | Medium | Open ↗ | — | |
| Is Graph Bipartite? | Medium | Open ↗ | — | |
| Surrounded Regions | Medium | Open ↗ | — | |
| Number of Provinces | Medium | Open ↗ | — | |
| Pacific Atlantic Water Flow | Medium | Open ↗ | — | |
| 01 Matrix | Medium | Open ↗ | — | |
| Word Ladder | Hard | Open ↗ | — |
Day 24 — Graph Part II
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Network Delay Time | Medium | Open ↗ | — | |
| Cheapest Flights Within K Stops | Medium | Open ↗ | — | |
| Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Open ↗ | — | |
| Min Cost to Connect All Points | Medium | Open ↗ | — | |
| Path With Minimum Effort | Medium | Open ↗ | — | |
| Redundant Connection | Medium | Open ↗ | — | |
| Critical Connections in a Network | Hard | Open ↗ | — |
Day 25 — Dynamic Programming
0 / 7
Day 26 — Dynamic Programming Part II
0 / 9
Day 27 — Trie
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Implement Trie (Prefix Tree) | Medium | Open ↗ | — | |
| Design Add and Search Words Data Structure | Medium | Open ↗ | — | |
| Word Search II | Hard | Open ↗ | — | |
| Longest Word in Dictionary | Medium | Open ↗ | — | |
| Replace Words | Medium | Open ↗ | — | |
| Maximum XOR of Two Numbers in an Array | Medium | Open ↗ | — | |
| Maximum XOR With an Element From Array | Hard | Open ↗ | — |