Convert Date to Binary

Convert Date to Binary - Problem

Math String Easy

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

date can be written in its binary representation obtained by converting year, month, and day to their binary representations without any leading zeroes and writing them down in year-month-day format.

Return the binary representation of date.

Input & Output

Example 1 — Standard Date

$ Input: date = "2019-06-10"

› Output: "11111100011-110-1010"

💡 Note: 2019 in binary is 11111100011, 06 in binary is 110, 10 in binary is 1010. Join with dashes: 11111100011-110-1010

Example 2 — Early Year

$ Input: date = "1900-01-01"

› Output: "11101101100-1-1"

💡 Note: 1900 in binary is 11101101100, 01 in binary is 1, 01 in binary is 1. Result: 11101101100-1-1

Example 3 — Large Numbers

$ Input: date = "2000-12-31"

› Output: "11111010000-1100-11111"

💡 Note: 2000 in binary is 11111010000, 12 in binary is 1100, 31 in binary is 11111. Result: 11111010000-1100-11111

Constraints

date.length == 10
date[4] == date[7] == '-'
All other characters in date are digits
date represents a valid Gregorian calendar date between 1000-01-01 and 9999-12-31

Visualization

Tap to expand

Asked in

G Google 15 M Microsoft 12 a Amazon 8

The key insight is to split the date into components and convert each integer to binary representation. Best approach uses built-in binary conversion functions. Time: O(log n), Space: O(1)

Common Approaches

✓ Memoization

⏱️ Time: N/A Space: N/A

Dp 2d

⏱️ Time: N/A Space: N/A

Built-in Binary Conversion

⏱️ Time: O(log n) Space: O(1)

Split the date string into components, parse each as integer, then use the language's built-in binary conversion function to get the binary representation without leading zeros.

Manual Binary Conversion

⏱️ Time: O(log n) Space: O(1)

Split the date string by dashes, then for each part (year, month, day), manually convert to binary by repeatedly dividing by 2 and collecting remainders.

Algorithm Steps — Algorithm Steps

Code -

solution.c — C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void toBinary(int num, char* result) {
    if (num == 0) {
        strcpy(result, "0");
        return;
    }
    
    char temp[32];
    int index = 0;
    
    while (num > 0) {
        temp[index++] = (num % 2) + '0';
        num /= 2;
    }
    
    // Reverse the string
    int i;
    for (i = 0; i < index; i++) {
        result[i] = temp[index - 1 - i];
    }
    result[i] = '\0';
}

int main() {
    char date[20];
    fgets(date, sizeof(date), stdin);
    
    // Remove newline if present
    int len = strlen(date);
    if (len > 0 && date[len-1] == '\n') {
        date[len-1] = '\0';
    }
    
    // Parse date in format yyyy-mm-dd
    int year, month, day;
    sscanf(date, "%d-%d-%d", &year, &month, &day);
    
    // Convert each part to binary
    char yearBinary[32], monthBinary[32], dayBinary[32];
    toBinary(year, yearBinary);
    toBinary(month, monthBinary);
    toBinary(day, dayBinary);
    
    // Print result in format year-month-day
    printf("%s-%s-%s\n", yearBinary, monthBinary, dayBinary);
    
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

✓ Linear Growth

Space Complexity

✓ Linear Space

12.4K Views

Medium Frequency

~8 min Avg. Time

543 Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen