Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Striver · takeUforward
Striver’s 79 Last Moment DSA Sheet
A compact last-moment revision list. This legacy snapshot is distinct from Striver’s current 75 sheet.
78 practice entries
0 / 78 completed0%
Arrays and Hashing
0 / 8
Binary Search
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Search in Rotated Sorted Array II | Medium | Open ↗ | ||
| Find Minimum in Rotated Sorted Array | Medium | Open ↗ | ||
| Find Peak Element | Medium | Open ↗ | ||
| Koko Eating Bananas | Medium | Open ↗ | ||
| Median of Two Sorted Arrays | Hard | Open ↗ | ||
| Minimize Max Distance to Gas Station May require a platform subscription | Hard | Open ↗ | ||
| Aggressive Cows | — | Open ↗ | ||
| Allocate Books | — | Open ↗ |
Linked List
0 / 6
Recursion and Backtracking
0 / 6
Stacks/Queues
0 / 6
Heaps
0 / 3
Trees (BT + BST)
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Diameter of Binary Tree | Easy | Open ↗ | ||
| Binary Tree Maximum Path Sum | Hard | Open ↗ | ||
| Lowest Common Ancestor of a Binary Tree | Medium | Open ↗ | ||
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Open ↗ | ||
| Binary Tree Inorder Traversal | Easy | Open ↗ | ||
| Delete Node in a BST | Medium | Open ↗ | ||
| Lowest Common Ancestor of a Binary Search Tree | Medium | Open ↗ | ||
| Two Sum IV - Input is a BST | Easy | Open ↗ | ||
| Bottom View of Binary Tree | — | Open ↗ | ||
| Burning Tree | — | Open ↗ | ||
| Largest BST | — | Open ↗ |
Graphs
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Rotting Oranges | Medium | Open ↗ | ||
| Word Ladder | Hard | Open ↗ | ||
| Number of Distinct Islands II May require a platform subscription | Hard | Open ↗ | — | |
| Course Schedule II | Medium | Open ↗ | ||
| Alien Dictionary May require a platform subscription | Hard | Open ↗ | ||
| Cheapest Flights Within K Stops | Medium | Open ↗ | ||
| Accounts Merge | Medium | Open ↗ | ||
| Critical Connections in a Network | Hard | Open ↗ | ||
| Dijkstra Algorithm | — | Open ↗ | ||
| Bellman Ford | — | Open ↗ | — | |
| Floyd Warshall | — | Open ↗ | ||
| Minimum Spanning Tree | — | Open ↗ |
Dynamic Programming
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| House Robber | Medium | Open ↗ | ||
| Minimum Path Sum | Medium | Open ↗ | ||
| Assign Cookies | Easy | Open ↗ | ||
| Longest Common Subsequence | Medium | Open ↗ | ||
| Longest Palindromic Subsequence | Medium | Open ↗ | ||
| Edit Distance | Medium | Open ↗ | ||
| Best Time to Buy and Sell Stock IV | Hard | Open ↗ | ||
| Longest Increasing Subsequence | Medium | Open ↗ | ||
| Burst Balloons | Hard | Open ↗ | ||
| Geek's Training | — | Open ↗ | ||
| Subset Sum Problem | — | Open ↗ | ||
| Rod Cutting | — | Open ↗ |