hi folks

https://www.teamblind.com/post/Very-Tough-Google-Interview---Heartbroken-B772z3Vq

someone posted a question that got me curious if this is solvable, none of blind lurkers have been able to solve this. asking for algo experts to chip in from cf community

Question: "given 100K points within coordinate system, find the coordinates of smallest square that contains cluster of at least 15% of all points"

It seems @Petr was interviewer for this candidate as only he can solve this in < 45 minute