Easy

Problem Link to the original HackerRank problem An extra day is added to the calendar almost every four years as February 29, and the day is called a leap day. It corrects the calendar for the fact that our planet takes approximately 365.25 days to orbit the sun. A leap year contains a leap day. In the Gregorian calendar, three conditions are used to identify leap years: The year can be evenly divided by 4, is a leap year, unless: The year can be evenly divided by 100, it is NOT a leap year, unless: The year is also evenly divisible by 400. Then it is a leap year. This means that in the Gregorian calendar, the years 2000 and 2400 are leap years, while 1800, 1900, 2100, 2200, 2300 and 2500 are NOT leap years. Source ...

Problem Link to the original HackerRank problem Task The provided code stub reads an integer, n, from STDIN. For all non-negative integers i < n, print i^2. Example n = 3 The list of non-negative integers that are less than n = 3 is [0, 1, 2]. Print the square of each number on a separate line. 0 1 4 Input Format The first and only line contains the integer, n. ...

Problem Link to the original HackerRank problem Task The provided code stub reads two integers, a and b, from STDIN. Add logic to print two lines. The first line should contain the result of integer division, a // b The second line should contain the result of float division, a / b. No rounding or formatting is necessary. Example a = 3 b = 5 The result of the integer division 3 // 5 = 0. The result of the integer division 3 / 5 = 0.6. Print: ...