human
Find two non | Function to check if two non - intersecting subarrays with equal sum exists or not.
Sort the given array.
Traverse the array.
Check for duplicate elements.
If no duplicate element is present in the array.
Driver code.
Given array.
Size of array"
How can the above be solved in Python?

Write me a code to find two non and the other steps required?
assistant
#Here is code to find two non and the other steps required.
 def findSubarrays ( arr , N ) :
	arr . sort ( ) ;
	i = 0 ;
	for i in range ( N - 1 ) :
		if ( arr [ i ] == arr [ i + 1 ] ) :
			print ( " YES " ) ;
			return ;
	print ( " NO " ) ;
if __name__ == ' _ _ main _ _ ' :
	arr = [ 4 , 3 , 0 , 1 , 2 , 0 ] ;
	N = len ( arr ) ;
	findSubarrays ( arr , N ) ;