Courses
Meta Coding Interview
Meta's fast set: stacks and parentheses, top-K, prefix products, and sliding windows.
- Islands
- 8
- Lessons
- 72
- Exercises
- 249
Complete codeDebugCode orderMultiple choiceTapTrace
Island 1Decide whether every bracket in a string opens and closes in the right order.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 2An increasing array skips some positive integers — find the kth one it skipped.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze4 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 3Flip at most k zeros to ones — find the longest all-ones stretch you can create.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 4Delete every value that appears more than once from a sorted linked list — keeping only true singletons.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 5For each position, compute the product of every other element — without using division.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 6Return the k values that occur most often in an array.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 7Delete the fewest parentheses so every remaining one is matched — letters stay put.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min
Island 8Find every unique quadruplet that hits a target sum — no repeats, any order inside.
- Decode the Problem3 exercises, 4 min
- Approach Check4 exercises, 4 min
- Build the Brute Force3 exercises, 5 min
- Find the Bottleneck2 exercises, 4 min
- Discover the Optimal Approach3 exercises, 4 min
- Assemble the Algorithm2 exercises, 5 min
- Read the Implementation3 exercises, 5 min
- Test and Analyze3 exercises, 4 min
- Boss BattleBoss8 exercises, 8 min