Binary Watch

A binary watch has 4 LEDs on the top to represent the hours (0-11), and 6 LEDs on the bottom to represent the minutes (0-59). Each LED represents a zero or one, with the least significant bit on the right.

Given an integer turnedOn which represents the number of LEDs that are currently on, ignoring PM, return all possible times the watch could represent. You may return the answer in any order.

The hour must not contain a leading zero.

  • For example, "01:00" is not valid. It should be "1:00".

The minute must consist of two digits and may contain a leading zero.

  • For example, "10:2" is not valid. It should be "10:02".
Example 1
InputturnedOn = 1
Output["0:01","0:02","0:04","0:08","0:16","0:32","1:00","2:00","4:00","8:00"]
With one LED turned on, each possible time has exactly one set bit among the hour and minute LEDs.
Example 2
InputturnedOn = 9
Output[]
No valid time can have 9 LEDs turned on while staying within hours 0-11 and minutes 0-59.

Constraints

  • 0 <= turnedOn <= 10

Asked at 5 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate