Search
⌘K
Get Premium
Leetcode 3450. Maximum Students on a Single Bench
Given a bench represented by a row of seats (some usable, some blocked), determine the maximum number of students that can be placed on that single bench without violating local constraints (for example, no two adjacent students). The core challenge is finding the largest valid placement under simple neighbor restrictions—typically solved with a greedy scan or simple DP.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.