Library Fine Solution In Javascript

by Travis Scott Lee

Problem

Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows:

1. If the book is returned on or before the expected return date, no fine will be charged (i.e.: fine = 0) .
2. If the book is returned after the expected return day but still within the same calendar month and year as the expected return date, fine = 15 Hackos x (the number of days late).
3. If the book is returned after the expected return month but still within the same calendar year as the expected return date, the fine = 500 Hackos x (the number of months late).
4. If the book is returned after the calendar year in which it was expected, there is a fixed fine of 10,000 Hackos.

Charges are based only on the least precise measure of lateness. For example, whether a book is due January 1, 2017 or December 31, 2017, if it is returned January 1, 2018, that is a year late and the fine would be .

Example

d1, m1, y1 = 14,7,2018

d2, m2, y2 = 5,7,2018

The first values are the return date and the second are the due date. The years are the same and the months are the same. The book is 14 -5 = 9days late. Return 9 * 15 = 135.

Function Description

Complete the libraryFine function in the editor below.

libraryFine has the following parameter(s):

• d1, m1, y1: returned date day, month and year, each an integer
• d2, m2, y2: due date day, month and year, each an integer

Returns

• int: the amount of the fine or 0 if there is none

Input Format

The first line contains 3 space-separated integers, d1,m1,y1, denoting the respective day, month, and year on which the book was returned.
The second line contains 3 space-separated integers, d2,m2,y2, denoting the respective day, month, and year on which the book was due to be returned.

Constraints

• 1 ≤ d1,d2 ≤ 31
• 1 ≤ m1,m2 ≤ 12
• 1 ≤ y1,y2 ≤ 3000
• It is guaranteed that the dates will be valid Gregorian calendar dates.

Solution

In this algorithm, we first check if the month and the year returned is equal to the month and the year of the due date, and if the the d1 is greater than d2. If it is, we return the difference of d1 and d2 and multiply it by 15. The next thing we check is if the year matches, but the months don’t. If it does, we take the difference of the months and multiply it by 500. Next, we check if just the years are different, if so, we return the flat fine of 10000. Finally if the book is returned before or the day of the due date, we return 0 because there is no fine.