Smallest Square from N Points

Problem Statement

Smallest Square from N Points Problem Description Given a set of N points in the Cartesian plane, write a program to find the side of the smallest square that can be drawn with the points coordinates from the given set. The sides of the square need to be parallel to the X and Y axes. The points act as the corners of the square. Constraints N <= 100 Input Format The first line of input contains an integer, N, the number of points. Next N lines of input contain X and Y, the coordinates of the N points, one in each line, separated by a single white space. Output Format A single line of output contains the side of the smallest square. Examples Example 1: Input: 8 2 3 2 5 1 1 5 1 2 2 3 1 3 5 1 3 Output: 2 Explanation: The problem asks for the smallest square whose corners are among the given points. Based on the provided example, a square with side length 2 can be formed using points from the input set as its corners, and it is the smallest such square possible. Other larger squares migh