Skip to main content
LeetCode 319, Medium. Topics: Math, Brainteaser. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 33 parametrized pytest cases, and a playground notebook:

Problem

<p>There are <code>n</code> bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb.</p> <p>On the third round, you toggle every third bulb (turning on if it’s off or turning off if it’s on). For the <code>i<sup>th</sup></code> round, you toggle every <code>i</code> bulb. For the <code>n<sup>th</sup></code> round, you only toggle the last bulb.</p> <p>Return <em>the number of bulbs that are on after <code>n</code> rounds</em>.</p>

Examples

Example 1

Constraints

  • 0 <= n <= 10<sup>9</sup>

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

Complexity

Tags

Last modified on September 7, 2026