How should I practice Flights 🚁?

Start by reading the full statement, solve the visible examples, then compare the pattern against related The Trade Desk online assessment problems in FastPrep.

Is Flights 🚁 associated with The Trade Desk?

FastPrep tags this as a The Trade Desk online assessment coding practice problem when the problem catalog has that company and stage context.

Flights 🚁

The Trade Desk● EasyOA

Learn

Problem statement

In the tale of two interconnected destinations served by flights, travelers aim to complete round trips between them. Flights in one direction take 100 minutes, and return flights take the same duration. Their goal is to determine the moment they'll finish their final round trip, assuming they always board the earliest available flight.

To aid in their journey, the function "tDeskFlights" requires three inputs: two arrays of departure times (one for outbound flights and one for return flights) and the number of round trips planned. It then returns the time in minutes when the last round trip concludes.

For original prompt, pls refer to source image ౨ৎ

Function

tDeskFlights(c2d: int[], d2c: int[], journies: int) → int

Examples

Example 1

c2d = [0, 200, 500]d2c = [99, 210, 450]journies = 1return = 310

Your journey begins as you depart from C to D at minute 0, arriving at D at 100. Shortly after, you return from D to C on the earliest available flight, departing D at 210. Thus, you reach C at 310, marking the conclusion of your journey.

Constraints

Unknown for now

Problem statement

Function

Examples

Example 1

Constraints

More The Trade Desk problems