Loading full content...
Progress
Getting Started
Binary Search
Implicitly Sorted Array
Depth First Search/ Backtracking
Introduction
DFS on Tree
Combinatorial Search
Breadth First Search
Graph
Two Pointers
Priority Queue / Heap
Introduction
Advanced
Divide and Conquer
Introduction
Binary Search
Dynamic Programming
Dynamic number of subproblems
Two Sequences
Game Theory
Other
Monotonic Stack
Data Structure Design
Company Specific
Amazon OA
Amazon Online Assessment Questions - Count LRU Cache Misses 🔒
- Nearest Cities
- Fill The Truck
- Turnstile
- Debt Records 🔒
- Baseball Scorekeeping 🔒
- Find The Highest Profit 🔒
- Squared Shortest Distance 🔒
- Find The Maximum Available Disk Space 🔒
- Fetch Items To Display 🔒
- Count Teams 🔒
- Highest Tenure 🔒
- Secret Fruit List 🔒
- Find Related Products 🔒
- Zombie Matrix 🔒
- Top N Buzzwords 🔒
- Load Balancer 🔒
- Optimize Memory Usage 🔒
- Find Critical Nodes 🔒
- Find Substrings 🔒
- Partition String 🔒
- Maximal Minimum Value Path I 🔒
- Maximal Minimum Value Path II 🔒
- Longest String Made Up Of Only Vowels 🔒
- Subtree with Maximum Average 🔒
- Connect Ropes 🔒
- Min Cost To Add New Roads 🔒
- Min Cost to Repair Edges (Minimum Spanning Tree II) 🔒
- Data Center Critical Connection 🔒
- Movies on Flight 🔒
- Treasure Island I 🔒
- Treasure Island II 🔒
- K Nearest Post Offices 🔒
- Roll Dice 🔒
- Min Cost to Connect All Nodes (Minimum Spanning Tree I) 🔒
- Cell State After N Days 🔒
- Move The Obstacle 🔒
- Shopkeeper Sale 🔒
- Favorite Genres 🔒
- Longest String Without 3 Consecutive Characters 🔒
- Most Common Word 🔒
- Substrings of size K with K distinct chars 🔒
- Top K Frequently Mentioned Keywords 🔒
- Product Suggestions 🔒
- Reorder Data in Log Files 🔒
Distance Between Nodes in BST 🔒- Optimal Utilization 🔒