Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
AlgoMap
AlgoMap 100
A compact, topic-organized set of 100 coding-interview problems.
100 practice entries
0 / 100 completed0%
Arrays & Hashing
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Contiguous Array | Medium | Open ↗ | — | |
| Add Binary | Easy | Open ↗ | — | |
| Corporate Flight Bookings | Medium | Open ↗ | — | |
| All Oone Data Structure | Hard | Open ↗ | — | |
| Count Primes | Medium | Open ↗ | — | |
| Add Digits | Easy | Open ↗ | — | |
| Design Browser History | Medium | Open ↗ | — | |
| Design HashMap | Easy | Open ↗ | — | |
| Design Circular Queue | Medium | Open ↗ | — | |
| First Missing Positive | Hard | Open ↗ | — | |
| Design Linked List | Medium | Open ↗ | — | |
| Design HashSet | Easy | Open ↗ | — |
Hashing
0 / 6
Strings
0 / 6
Two Pointers
0 / 6
Sliding Window
0 / 6
Stacks & Queues
0 / 6
Linked List
0 / 7
Binary Search
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Capacity To Ship Packages Within D Days | Medium | Open ↗ | — | |
| Arranging Coins | Easy | Open ↗ | — | |
| Find First and Last Position of Element in Sorted Array | Medium | Open ↗ | — | |
| Find K Closest Elements | Medium | Open ↗ | — | |
| Binary Search | Easy | Open ↗ | — | |
| Find Minimum in Rotated Sorted Array | Medium | Open ↗ | — | |
| Median of Two Sorted Arrays | Hard | Open ↗ | — |
Trees
0 / 12
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| 01 Matrix | Medium | Open ↗ | — | |
| Average of Levels in Binary Tree | Easy | Open ↗ | — | |
| All Nodes Distance K in Binary Tree | Medium | Open ↗ | — | |
| All Paths From Source to Target | Medium | Open ↗ | — | |
| Balanced Binary Tree | Easy | Open ↗ | — | |
| Amount of Time for Binary Tree to Be Infected | Medium | Open ↗ | — | |
| Binary Tree Maximum Path Sum | Hard | Open ↗ | — | |
| As Far from Land as Possible | Medium | Open ↗ | — | |
| Binary Search Tree Iterator | Medium | Open ↗ | — | |
| Binary Tree Inorder Traversal | Easy | Open ↗ | — | |
| Binary Tree Level Order Traversal | Medium | Open ↗ | — | |
| Binary Tree Level Order Traversal II | Medium | Open ↗ | — |
Tries
0 / 3
Heaps
0 / 6
Graphs
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Accounts Merge | Medium | Open ↗ | — | |
| Cheapest Flights Within K Stops | Medium | Open ↗ | — | |
| Alien Dictionary | Hard | Open ↗ | — | |
| Course Schedule | Medium | Open ↗ | — | |
| Course Schedule II | Medium | Open ↗ | — | |
| Find if Path Exists in Graph | Easy | Open ↗ | — | |
| Evaluate Division | Medium | Open ↗ | — | |
| Find Eventual Safe States | Medium | Open ↗ | — | |
| Critical Connections in a Network | Hard | Open ↗ | — |
Backtracking
0 / 6
Dynamic Programming
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Arithmetic Slices | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock III | Hard | Open ↗ | — | |
| Best Time to Buy and Sell Stock with Cooldown | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock with Transaction Fee | Medium | Open ↗ | — | |
| Coin Change | Medium | Open ↗ | — | |
| Best Time to Buy and Sell Stock IV | Hard | Open ↗ | — | |
| Coin Change II | Medium | Open ↗ | — | |
| Combination Sum IV | Medium | Open ↗ | — |