Daily Coding Problem: Problem #1006 [Easy]

Good morning! Here's your coding interview problem for today.

This problem was asked by Facebook.

Suppose you are given two lists of n points, one list p₁, p₂, ..., p_n on the line y = 0 and the other list q₁, q₂, ..., q_n on the line y = 1. Imagine a set of n line segments connecting each point p_i to q_i. Write an algorithm to determine how many pairs of the line segments intersect.

Upgrade to premium and get in-depth solutions to every problem, including this one. Since you were referred by one of our affiliates, you'll get a 10% discount on checkout!

If you liked this problem, feel free to forward it along so they can subscribe here! As always, shoot us an email if there's anything we can help with!

Practice makes perfect. Book a mock interview with a FAANG-level interviewer today from our friends at Exponent (10% off!).

System design interviews are becoming more popular in SWE interviews. Here's how to prepare.

No more? Snooze or unsubscribe.