← All problemsSign in

957. Prison Cells After N Days

LeetCodeArrayHash TableMathBit ManipulationOpen on judge ↗

There are 8 prison cells in a row and each cell is either occupied or vacant. Each day, whether the cell is occupied or vacant changes according to the following rules: - If a cell has two adjacent neighbors that are both occupied or both vacant, then the cell becomes occupied. - Otherwise, it becomes vacant. Note that because the prison is a row, the first and the last cells in the row can't

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start