human
Find the index having sum of elements on its left equal to reverse of the sum of elements on its right | Function to check if a number is equal to the reverse of digits of other number.
Stores reverse of digits of rightSum.
Stores rightSum.
Calculate reverse of digits of temp.
Update rev.
Update temp.
If reverse of digits of rightSum equal to leftSum.
Function to find the index that satisfies the condition.
Stores sum of array elements on right side of each index.
Stores sum of array elements on left side of each index.
Traverse the array.
Update rightSum.
Traverse the array.
Update rightSum.
If leftSum equal to reverse of digits of rightSum.
Update leftSum.
Driver Code"
Solution in Python:

Write me a code to find the index having sum of elements on its left equal to reverse of the sum of elements on its right and the other steps required?
assistant
#Here is code to find the index having sum of elements on its left equal to reverse of the sum of elements on its right and the other steps required.
 def checkReverse ( leftSum , rightSum ) :
	rev = 0
	temp = rightSum
	while ( temp != 0 ) :
		rev = ( rev * 10 ) + ( temp % 10 )
		temp //= 10
	if ( rev == leftSum ) :
		return True
	return False
def findIndex ( arr , N ) :
	rightSum = 0
	leftSum = 0
	for i in range ( N ) :
		rightSum += arr [ i ]
	for i in range ( N ) :
		rightSum -= arr [ i ]
		if ( checkReverse ( leftSum , rightSum ) ) :
			return i
		leftSum += arr [ i ]
	return - 1
if __name__ == ' _ _ main _ _ ' :
	arr = [ 5 , 7 , 3 , 6 , 4 , 9 , 2 ]
	N = len ( arr )
	print ( findIndex ( arr , N ) )