You only have free questions left (including this one).
But it doesn't have to end here! Sign up for the 7-day coding interview crash course and you'll get a free Interview Cake problem every week.
You've built an inflight entertainment system with on-demand movie streaming.
Users on longer flights like to start a second movie right when their first one ends, but they complain that the plane usually lands before they can see the ending. So you're building a feature for choosing two movies whose total runtimes will equal the exact flight length.
Write a function that takes an integer $flightLength (in minutes) and an array of integers $movieLengths (in minutes) and returns a boolean indicating whether there are two numbers in $movieLengths whose sum equals $flightLength.
When building your function:
Assume your users will watch exactly two movies
Don't make your users watch the same movie twice
Optimize for runtime over memory
We can do this in time, where n is the length of $movieLengths.
Remember: your users shouldn't watch the same movie twice. Are you sure your function won’t give a false positive if the array has one element that is half $flightLength?
Start your free trial!
Log in or sign up with one click to get immediate access to free mock interview questions