Smallest Square from N Points

Problem Statement

Smallest Square from N Points Problem Description You are given N points in the Cartesian plane. Consider every square whose four corners are all points of the given set and whose sides are parallel to the X and Y axes. Among all such squares, report the side length of the smallest one. Implement the function findSmallestSquareSide , which receives the number of points and the list of points and returns that side length. Input Format The first line contains a single integer N, the number of points. Each of the next N lines contains two space-separated integers X and Y, the coordinates of one point. Output Format Print a single line containing one integer: the side length of the smallest axis-parallel square whose four corners are all points of the given set. If no such square exists, print 0 . (inferred - the source states the constraints do not guarantee a square exists but never names the fallback value; 0 is what the stored reference emits, and it is not a legal side length, so it i