freecodecamp--freecodecamp/curriculum/challenges/english/blocks/daily-coding-challenges-python/691f7773cddba1caf1bf5ecc.md

id, title, challengeType, dashedName

id	title	challengeType	dashedName
691f7773cddba1caf1bf5ecc	Challenge 133: Daylight Hours	29	challenge-133

--description--

December 21st is the winter solstice for the northern hemisphere and the summer solstice for the southern hemisphere. That means it's the day with the least daylight in the north and the most daylight in the south.

Given a latitude number from -90 to 90, return a rough approximation of daylight hours on the solstice using the following table:

Latitude	Daylight Hours
-90	24
-75	23
-60	21
-45	15
-30	13
-15	12
0	12
15	11
30	10
45	9
60	6
75	2
90	0

• If the given latitude does not exactly match a table entry, use the value of the closest latitude.

--hints--

daylight_hours(45) should return 9.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(45), 9)`)
}})

daylight_hours(0) should return 12.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(0), 12)`)
}})

daylight_hours(-90) should return 24.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(-90), 24)`)
}})

daylight_hours(-10) should return 12.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(-10), 12)`)
}})

daylight_hours(23) should return 10.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(23), 10)`)
}})

daylight_hours(88) should return 0.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(88), 0)`)
}})

daylight_hours(-33) should return 13.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(-33), 13)`)
}})

daylight_hours(70) should return 2.

({test: () => { runPython(`
from unittest import TestCase
TestCase().assertEqual(daylight_hours(70), 2)`)
}})

--seed--

--seed-contents--

def daylight_hours(latitude):

    return latitude

--solutions--

def daylight_hours(latitude):
    table = [
        (-90, 24),
        (-75, 23),
        (-60, 21),
        (-45, 15),
        (-30, 13),
        (-15, 12),
        (0, 12),
        (15, 11),
        (30, 10),
        (45, 9),
        (60, 6),
        (75, 2),
        (90, 0)
    ]

    closest_lat, hours = table[0]

    for lat, h in table:
        if abs(lat - latitude) < abs(closest_lat - latitude):
            closest_lat, hours = lat, h

    return hours