Leetcode 319. Bulb Switcher

Given n bulbs toggled on each i-th round for multiples of i, determine how many bulbs remain on after n rounds — this reduces to counting integers ≤ n with an odd number of divisors (perfect squares), i.e., floor(sqrt(n)).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 319. Bulb Switcher

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact