human
Minimum number of points to be removed to get remaining points on one side of axis | Function to find the minimum number of points.
Number of points on the left of Y - axis ..
Number of points on the right of Y - axis ..
Number of points above X - axis ..
Number of points below X - axis ..
Driver Code"
Solution in Python:

=====
Write me a code to minimum number of points to be removed to get remaining points on one side of axis and the other steps required?
assistant
#Here is code to minimum number of points to be removed to get remaining points on one side of axis and the other steps required.
 def findmin ( p , n ) :
	a , b , c , d = 0 , 0 , 0 , 0
	for i in range ( n ) :
		if ( p [ i ] [ 0 ] <= 0 ) :
			a += 1
		elif ( p [ i ] [ 0 ] >= 0 ) :
			b += 1
		if ( p [ i ] [ 1 ] >= 0 ) :
			c += 1
		elif ( p [ i ] [ 1 ] <= 0 ) :
			d += 1
	return min ( [ a , b , c , d ] )
p = [ [ 1 , 1 ] , [ 2 , 2 ] , [ - 1 , - 1 ] , [ - 2 , 2 ] ]
n = len ( p )
print ( findmin ( p , n ) )