Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given a list of buildings, each with a start and end time, find the maximum number of buildings that can be constructed without overlapping construction times.

Run the code to see the output here...