Airport Limousine
Reported by candidates from Snowflake's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Snowflake's April OA included a problem called Airport Limousine with no stated constraints or examples in candidate reports. That's the trap. You're going in blind on logic and edge cases. The problem likely involves scheduling, routing, or capacity management around airport transportation. This is exactly where StealthCoder helps: if the problem statement is terse or you blank on the approach, you get a real-time solution while the proctor sees only your typing.
Pattern and pitfall
Airport Limousine problems typically hinge on greedy scheduling or simulation. The trick is usually optimizing pickup order, minimizing wait time, or respecting vehicle capacity limits. Candidates reported no pattern hints, which means Snowflake is testing your ability to infer constraints from minimal description and code defensively. The common pitfall is assuming a simple greedy approach (earliest pickup first) works when you actually need to cluster passengers by location or time window. Build your solution to handle empty inputs, single passenger, and overflow cases explicitly. StealthCoder acts as your safety net on the live OA if you misread the prompt or hit an implementation wall.
StealthCoder is the hedge for the one pattern you didn't drill. It runs invisibly during the screen share.
You can drill Airport Limousine cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. If you're reading this with an OA window open, you're who this was built for.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Snowflake's OA.
Snowflake reuses patterns across OAs. If you're reading this with an OA window open, you're who this was built for. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Airport Limousine FAQ
Is this a sorting or greedy problem?+
Likely greedy. You're probably optimizing a sequence of pickups or drop-offs. Sort by arrival time, location, or distance first, then simulate the limousine route. The trick is figuring out which dimension matters from the problem statement alone.
What happens if passengers don't fit in the limo?+
That's the edge case Snowflake wants. Your code should handle capacity limits. You might need to split runs, queue overflow passengers, or reject them. Read the problem carefully for the acceptance rule.
How much time do I have to code this?+
Snowflake OAs are usually 60-90 minutes for 1-2 problems. Airport Limousine sounds like a single medium-hard problem. Plan 30-40 minutes to parse the problem, 20-30 to code and test.
Will simulation or math work here?+
Simulation is more likely. You're probably iterating through time steps or passenger arrivals, moving the limo, and tracking state. Pure math solutions are rare for transport problems unless there's a closed-form formula hidden in the constraints.
Should I prepare by solving airport scheduling problems elsewhere?+
Not if you have 48 hours. Read the actual problem three times, write pseudocode first, then code. If you blank, StealthCoder will give you a working pattern. Cramming unrelated scheduling problems won't help you parse Snowflake's specific wording.