2-D Point Meeting
You are given $N$ *distinct* points in a $2$-D plane, numbered $1$ through $N$. The X-coordinate of the points are $X_1, X_2, \ldots, X_N$ respectively and the Y-coordinates are $Y_1, Y_2, \ldots, Y_N$ respectively. Your goal is to make the location of all the $N$ points equal to that of each other. To achieve this, you can do some operations. In one operation, you choose an index $i\;(1 \leq i \
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start