LeetCode Bulb Switcher Challenge | Dataford Interview Questions

LeetCode Bulb Switcher (https://leetcode.com/problems/bulb-switcher/)

Asked in the technical interview stage. Author replied that the LC mentioned in the post was this problem.

Task

There are n bulbs, initially off. Round i toggles every bulb whose number is divisible by i. Return the number of bulbs that remain on after all n rounds.

Contract

Implement bulb_switch(n), where n is an integer, and return an integer.

Constraints

0 <= n <= 10^9
Return the number of bulbs that remain on after all rounds

Function Signature

def bulb_switch(n):

Your question is LeetCode Bulb Switcher Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem