# Number Of Ways To Divide A Long Corridor: Interview Notes
Number Of Ways To Divide A Long Corridor shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A corridor of seats 'S' and plants 'P'; divide into sections that each contain exactly two seats, using non-overlapping partitions after some plants. If the total number of seats is odd or <2, answer 0. Between each consecutive pair of two-seat groups, there are (plants + 1) places to put a divider; multiply those choices.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Allowing a section with 0 or 1 seat, or putting dividers inside a two-seat pair.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at linkjob.ai.