Day 10: LeetCode 319 [Bulb Switcher]
Problem Description: There are n bulbs that are initially off. You first turn on all the bulbs, then you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. Return the number of bulbs that are on after n rounds.
Link to LeetCode Problem: https://leetcode.com/problems/bulb-switcher/description/
My thought process:
only bulbs are on which are perfect sq
