You are given an integer array bulbs representing a sequence of operations on light bulbs, where all light bulbs are initially turned off.

For each bulb identifier in bulbs, toggle its state: if the bulb is off, switch it on, and if it is on, switch it off.

Return an array containing the identifiers of all light bulbs that remain turned on at the end, sorted in ascending order.

Constraints:

• $1 \leq$ bulbs.length $\leq 100$

• $1 \leq$ bulbs[i] $\leq 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.