Available question text
Given n bulbs initially on and four toggle operations (flip all / evens / odds / positions 3k+1), determine how many distinct final configurations are reachable after exactly presses button presses. Key idea: the operations commute and the bulb pattern repeats every 6 positions, so the problem reduces to enumerating reachable bitmasks on a small prefix.
Related questions
Continue with questions that share topics or the same question type.
- Bulb Switcher
Coding · Brainteaser · Math
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
- 1 leetcode hard complex dp questions
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 672. Bulb Switcher II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source