Click here to Skip to main content
15,901,122 members
Please Sign up or sign in to vote.
1.00/5 (1 vote)
The flying range of a fighter plane i is denoted by the pair (xi, yi). Where xi and
yi are the points on an infinite coordinate line. You are given the flying ranges of 5
fighter planes in a squadron. Find whether there exists a fighter plane that covers
the range of all other fighter planes. If there exists such a plane print its number.
If such a plane doesn’t exist, print -1. We will assume that one fighter plane of
range (a, b) covers the range (c, d) of another if a ≤ c ≤ d ≤ b. It is guaranteed that
no two ranges coincide.

What I have tried:

Updated 2-Dec-22 19:09pm

1 solution

While we are more than willing to help those that are stuck, that doesn't mean that we are here to do it all for you! We can't do all the work, you are either getting paid for this, or it's part of your grades and it wouldn't be at all fair for us to do it all for you.

So we need you to do the work, and we will help you when you get stuck. That doesn't mean we will give you a step by step solution you can hand in!
Start by explaining where you are at the moment, and what the next step in the process is. Then tell us what you have tried to get that next step working, and what happened when you did.

If you are having problems getting started at all, then this may help: How to Write Code to Solve a Problem, A Beginner's Guide[^]
Share this answer

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900