Loading the journal
Greedy Allocation / Boundary CheckSolved Nov 9, 2025
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Step 1
Know these before you start
Tick what you already know
Concept videoWatch the concept video if the pattern is new to you.
Step 2
Try it on paper
5–10 minutes, no code yet
Given N people needing seats and an array of M seats (0=vacant, 1=occupied), find if all N people can be seated such that no two people sit next to each other (i.e., new person must have empty seats on both sides, if they exist).
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code