Earliest Finish Time for Land and Water Rides I | 3633 (Greedy)
A person can choose to take either the Land ride first or the Water ride first.
If they take Ride A first, Ride B can only start after Ride A finishes, or at Ride B's scheduled start time (whichever is later).
We evaluate both scenarios (Land ➡️ Water and Water ➡️ Land) to find the absolute minimum finish time.
Complexity Analysis:
Time Complexity: O(L . W) where L is the number of land rides and W is the number of water rides.
Space Complexity: O(L + W) to store the calculated ending times.
#cpp #datastructures #algorithms #competitiveprogramming #codinginterview #placementpreparation #softwareengineering #intervalscheduling #timecomplexity