Yo!

I lied. I actually have 2 problems:

1. Given n vertical line segments i.e. they are parallel to the y axis, find if there exists a straight line of any slope which passes through all the given line segments.

2. Given n lines such that none are parallel and there are nC2 intersection points, find the number of intersection points to the right of y axis and do this in most optimized time complexity.

I welcome all solutions :)

Thanks!

Hey Mike,

First of all, I hope you're doing well :)

It's almost very clear that Google has achieved quantum supermacy (https://www.youtube.com/watch?v=-ZNEzzDcllU).

So, do we still have to write polynomial codes or you'll be installing such quantum computers for judging solutions?

Thanks!