human
Maximum Manhattan distance between a distinct pair from N coordinates | Function to calculate the maximum Manhattan distance.
List to store maximum and minimum of all the four forms.
Sorting both the vectors.
Driver code.
Given Co - ordinates.
Function call"
Solution in Python:

Can you provide a code to maximum Manhattan distance between a distinct pair from N coordinates and the other steps required?
assistant
#Here is code to maximum Manhattan distance between a distinct pair from N coordinates and the other steps required.
 def MaxDist ( A , N ) :
	V = [ 0 for i in range ( N ) ]
	V1 = [ 0 for i in range ( N ) ]
	for i in range ( N ) :
		V [ i ] = A [ i ] [ 0 ] + A [ i ] [ 1 ]
		V1 [ i ] = A [ i ] [ 0 ] - A [ i ] [ 1 ]
	V . sort ( )
	V1 . sort ( )
	maximum = max ( V [ - 1 ] - V [ 0 ] , V1 [ - 1 ] - V1 [ 0 ] )
	print ( maximum )
if __name__ == " _ _ main _ _ " :
	N = 3
	A = [ [ 1 , 2 ] , [ 2 , 3 ] , [ 3 , 4 ] ]
	MaxDist ( A , N )