1154. Day of the Year

EasyMathString

Problem Description

The problem requires us to determine the day number of the year for a given date formatted as YYYY-MM-DD. This means we need to calculate which day of the year the given date is. For example, January 1st would be day number 1, February 1st would be day number 32 (assuming it is not a leap year), and so on. To solve this, we need to consider the varying lengths of each month and also account for leap years, which affect the length of February.

Intuition

The solution takes a straightforward approach to determining the day number by summing the number of days in each month leading up to the given month and then adding the days elapsed in the current month. The first step in the solution is to parse the input string to extract the year, month, and day as integers.

Leap years are taken into account by checking if February should have 28 or 29 days. If the year is divisible by 400 or divisible by 4 but not by 100, it is a leap year, so February has 29 days; otherwise, it has 28 days. This rule comes from the definition of leap years in the Gregorian calendar.

An array named days is then constructed, which holds the number of days in each month, adjusted for leap years for February. The day number is calculated by summing the days in the months prior to the given month and then adding the day of the month itself. The index into the days array is one less than the month number since array indices in Python are zero-based, but months are one-based (i.e., January is month 1, not month 0).

Learn more about Math patterns.

Solution Approach

The implementation uses a simple algorithm with basic data structures, specifically a list to represent the number of days in each month.

Here's a step-by-step breakdown of the dayOfYear function:

Parse the date: First, the function splits the input date string into the year y, month m, and day d components by using the split('-') method and converting each to an integer.
Determine if the year is a leap year: Based on the extracted year, it calculates whether it is a leap year. The given year y is a leap year if it is evenly divisible by 400 or it is divisible by 4 but not by 100. This leap year check is used to decide the number of days in February (29 days for a leap year, otherwise 28).
Store days per month: A list named days is created, holding the number of days in each month, and it is adjusted for leap years for February. The list is indexed such that days[0] corresponds to January, days[1] to February, and so on up to days[11] for December.
Calculate the day number: Finally, the function returns the sum of the days in the months before the given month (note that days[: m - 1] creates a slice of the list from the beginning up to but not including the index m - 1). We subtract 1 from m because the days in the current month (m) have not yet elapsed completely, so we only want to sum the days of the full months that have passed. Then it adds the days d from the current month to this sum.

The algorithm's efficiency comes from the constant time operations to check for a leap year and the simple summation of integers in a list, making the overall time complexity O(1), since the list is of fixed length (12 elements for the months of the year), and thus does not depend on the size of the input. The space complexity is also O(1) because the list of days per month does not grow with the input size.

Ready to land your dream job?

Unlock your dream job with a 2-minute evaluator for a personalized learning plan!

Start Evaluator

Example Walkthrough

Let's walk through an example to illustrate the solution approach using the date "2021-03-01."

Parse the date: The input date string "2021-03-01" is split into year y=2021, month m=3, and day d=1.
Determine if the year is a leap year: The year 2021 is not a leap year because it is not divisible by 400 and, while it is divisible by 4, it is also divisible by 100. Therefore, February of 2021 has 28 days.
Store days per month: We create a list days that holds the number of days in each month for the year 2021: [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31].
Calculate the day number: We sum the days in the months prior to March, which are January and February: 31 (January) + 28 (February) = 59. Since we are calculating for March 1st, we add the day d, which is 1 in this case, to the sum of the previous months: 59 + 1 = 60.

The day number for "2021-03-01" is therefore 60. It is the 60th day of the year 2021.

Solution Implementation

1class Solution:
2    def dayOfYear(self, date: str) -> int:
3        # Split the date string into year, month, and day components
4        year, month, day = (int(part) for part in date.split('-'))
5      
6        # Determine if the year is a leap year for February day count
7        # Leap year occurs every 4 years, except for years that are divisible by 100
8        # unless they are divisible by 400 as well
9        is_leap_year = year % 400 == 0 or (year % 4 == 0 and year % 100 != 0)
10        february_days = 29 if is_leap_year else 28
11      
12        # List of days in each month, taking into account leap year for February
13        days_in_month = [31, february_days, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]
14      
15        # Calculate the day of the year by summing the days in the previous months
16        # and adding the day of the current month
17        day_of_year = sum(days_in_month[:month - 1]) + day
18      
19        return day_of_year
20

1class Solution {
2  
3    // Method to calculate the day of the year given a date
4    public int dayOfYear(String date) {
5        // Parse the year, month, and day from the input string
6        int year = Integer.parseInt(date.substring(0, 4));
7        int month = Integer.parseInt(date.substring(5, 7));
8        int day = Integer.parseInt(date.substring(8));
9      
10        // Calculate if the year is a leap year
11        boolean isLeapYear = (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
12        // Set the number of days in February depending on the leap year
13        int februaryDays = isLeapYear ? 29 : 28;
14        // Array containing the number of days in each month
15        int[] daysOfMonth = {31, februaryDays, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
16      
17        // Initialize the count of days with the days of the given month
18        int dayOfYearCount = day;
19      
20        // Add the days of all the months before the given month
21        for (int i = 0; i < month - 1; ++i) {
22            dayOfYearCount += daysOfMonth[i];
23        }
24      
25        // Return the computed day of the year
26        return dayOfYearCount;
27    }
28}
29

1#include <string>
2using std::string;  // Including string and using the standard namespace for string
3
4class Solution {
5public:
6    // This function calculates the day of the year given a date in the format YYYY-MM-DD
7    int dayOfYear(string date) {
8        // Extract the year, month, and day as integers from the input string
9        int year = stoi(date.substr(0, 4));
10        int month = stoi(date.substr(5, 2));
11        int day = stoi(date.substr(8));
12
13        // Check if the year is a leap year
14        int febDays = (year % 400 == 0 || (year % 4 == 0 && year % 100 != 0)) ? 29 : 28;
15
16        // Initialize the array with the number of days for each month
17        int daysPerMonth[] = {31, febDays, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
18
19        // Start with the given day
20        int totalDays = day;
21
22        // Add the days of the months preceding the given month
23        for (int i = 0; i < month - 1; ++i) {
24            totalDays += daysPerMonth[i];
25        }
26
27        // Return the total count of days
28        return totalDays;
29    }
30};
31

1/**
2 * Calculates the day of the year based on the given date string.
3 * 
4 * @param {string} date - The input date in the format "YYYY-MM-DD".
5 * @return {number} - The day of the year.
6 */
7function dayOfYear(date: string): number {
8    // Extract year, month, and day from the date string.
9    const year: number = +date.slice(0, 4);
10    const month: number = +date.slice(5, 7);
11    const day: number = +date.slice(8);
12
13    // Determine if the year is a leap year.
14    const isLeapYear: boolean = year % 400 === 0 || (year % 4 === 0 && year % 100 !== 0);
15
16    // Define the number of days in February depending on the leap year.
17    const februaryDays: number = isLeapYear ? 29 : 28;
18
19    // Create an array representing the days in each month.
20    const monthDays: number[] = [31, februaryDays, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
21
22    // Sum the days from the preceding months and add the days from the current month.
23    return monthDays.slice(0, month - 1).reduce((accumulator, current) => accumulator + current, day);
24}
25
26// Example usage:
27// const result: number = dayOfYear("2022-12-31");
28// console.log(result); // Outputs the day of the year for December 31, 2022
29

Time and Space Complexity

The given Python code computes the day of the year for a given date in the format YYYY-MM-DD. Upon analyzing the code, we can derive its time complexity and space complexity.

Time Complexity

The time complexity of the code is O(1).

The date string splitting and integer conversion happens in constant time, since the date format is fixed.
The logic to determine if it's a leap year for setting the value of February (v) is done in constant time.
The creation of the days array, which contains the number of days for each month, is a constant operation because the array size does not change dynamically; it is always size 12.
The sum(days[: m - 1]) operation also has a constant time complexity since it will never sum more than 11 elements (the months before December).

Since none of these operations depends on the size of an input, they all occur in constant time.

Space Complexity

The space complexity of the code is also O(1).

The additional space used by the variables y, m, d, and v is constant and does not depend on the input size.
The days array is also constant in size; it always contains 12 integers.
The summation operation does not consume additional space that scales with input.

Therefore, both the additional memory used for the calculation and the output size are fixed, resulting in a constant space complexity.

Learn more about how to find time and space complexity quickly using problem constraints.

Discover Your Strengths and Weaknesses: Take Our 2-Minute Quiz to Tailor Your Study Plan:

Question 1 out of 10

What does the following code do?

1def f(arr1, arr2):
2  i, j = 0, 0
3  new_arr = []
4  while i < len(arr1) and j < len(arr2):
5      if arr1[i] < arr2[j]:
6          new_arr.append(arr1[i])
7          i += 1
8      else:
9          new_arr.append(arr2[j])
10          j += 1
11  new_arr.extend(arr1[i:])
12  new_arr.extend(arr2[j:])
13  return new_arr
14

1public static List<Integer> f(int[] arr1, int[] arr2) {
2  int i = 0, j = 0;
3  List<Integer> newArr = new ArrayList<>();
4
5  while (i < arr1.length && j < arr2.length) {
6      if (arr1[i] < arr2[j]) {
7          newArr.add(arr1[i]);
8          i++;
9      } else {
10          newArr.add(arr2[j]);
11          j++;
12      }
13  }
14
15  while (i < arr1.length) {
16      newArr.add(arr1[i]);
17      i++;
18  }
19
20  while (j < arr2.length) {
21      newArr.add(arr2[j]);
22      j++;
23  }
24
25  return newArr;
26}
27

1function f(arr1, arr2) {
2  let i = 0, j = 0;
3  let newArr = [];
4  
5  while (i < arr1.length && j < arr2.length) {
6      if (arr1[i] < arr2[j]) {
7          newArr.push(arr1[i]);
8          i++;
9      } else {
10          newArr.push(arr2[j]);
11          j++;
12      }
13  }
14  
15  while (i < arr1.length) {
16      newArr.push(arr1[i]);
17      i++;
18  }
19  
20  while (j < arr2.length) {
21      newArr.push(arr2[j]);
22      j++;
23  }
24  
25  return newArr;
26}
27

Find the intersection of two arrays.

Check if one array is a subsequence of the other.

Merge two sorted arrays.

Finding median values of 2 arrays.

I don’t know