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.
A crack team of love scientists from OkEros (a hot new dating site) have devised a way to represent dating profiles as rectangles on a two-dimensional plane.
They need help writing an algorithm to find the intersection of two users' love rectangles. They suspect finding that intersection is the key to a matching algorithm so powerful it will cause an immediate acquisition by Google or Facebook or Obama or something.
Write a function to find the rectangular intersection of two given love rectangles.
As with the example above, love rectangles are always "straight" and never "diagonal." More rigorously: each side is parallel with either the x-axis or the y-axis.
They are defined as hashes like this:
Your output rectangle should use this format as well.
What if there is no intersection? Does your function do something reasonable in that case?
What if one rectangle is entirely contained in the other? Does your function do something reasonable in that case?
What if the rectangles don't really intersect but share an edge? Does your function do something reasonable in that case?
Do some parts of your function seem very similar? Can they be refactored so you repeat yourself less?
Let's break this problem into subproblems. How can we divide this problem into smaller parts?
We could look at the two rectangles’ "horizontal overlap" or "x overlap" separately from their "vertical overlap" or "y overlap."
Lets start with a helper function findXOverlap.
Need help finding the x overlap?
Since we’re only working with the x dimension, we can treat the two rectangles' widths as ranges on a 1-dimensional number line.
What are the possible cases for how these ranges might overlap or not overlap? Draw out some examples!
There are four relevant cases:
1) The ranges partially overlap:
2) One range is completely contained in the other:
3) The ranges don't overlap:
4) The ranges "touch" at a single point:
Let's start with the first 2 cases. How do we compute the overlapping range?
One of our ranges starts "further to the right" than the other. We don't know ahead of time which one it is, but we can check the starting points of each range to see which one has the highestStartPoint. That highestStartPoint is always the left-hand side of the overlap, if there is one.
Not convinced? Draw some examples!
Similarly, the right-hand side of our overlap is always the lowestEndPoint. That may or may not be the end point of the same input range that had the highestStartPoint—compare cases (1) and (2).
This gives us our x overlap! So we can handle cases (1) and (2). How do we know when there is no overlap?
If highestStartPoint > lowestEndPoint, the two rectangles do not overlap.
But be careful—is it just greater than or is it greater than or equal to?
It depends how we want to handle case (4) above.
If we use greater than, we treat case (4) as an overlap. This means we could end up returning a rectangle with zero width, which ... may or may not be what we're looking for. You could make an argument either way.
Let's say a rectangle with zero width (or zero height) isn't a rectangle at all, so we should treat that case as "no intersection."
Can you finish findXOverlap?
Here's one way to do it:
How can we adapt this for the rectangles’ ys and heights?
Can we just make one findRangeOverlap function that can handle x overlap and y overlap?
Yes! We simply use more general parameter names:
We've solved our subproblem of finding the x and y overlaps! Now we just need to put the results together.
We divide the problem into two halves:
Both problems are basically the same as finding the intersection of two "ranges" on a 1-dimensional number line.
So we write a helper function findRangeOverlap that can be used to find both the x overlap and the y overlap, and we use it to build the rectangular overlap:
time and space.
What if we had an array of rectangles and wanted to find all the rectangular overlaps between all possible pairs of two rectangles within the array? Note that we'd be returning an array of rectangles.
What if we had an array of rectangles and wanted to find the overlap between all of them, if there was one? Note that we'd be returning a single rectangle.
This is an interesting one because the hard part isn't the time or space optimization—it's getting something that works and is readable.
For problems like this, I often see candidates who can describe the strategy at a high level but trip over themselves when they get into the details.
Don't let it happen to you. To keep your thoughts clear and avoid bugs, take time to:
Powered by qualified.io