You are given a string date representing a Gregorian calendar date in the format "yyyy-mm-dd".

Convert the year, month, and day into their respective binary representations without leading zeros, and return the resulting string with each part separated by '-'.

Constraints:

• date.length $= 10$

• date[4] $==$ date[7] $==$ '-', and all other characters in date are digits.

• The input is generated such that date represents a valid Gregorian calendar date between Jan $1^{ ext{st}}$, $1900$ and Dec $31^{ ext{st}}$, $2100$ (both inclusive).

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.