human
Find the index of the left pointer after possible moves in the array | Function that returns the index of the left pointer.
there 's only one element  in the array.
initially both are at end.
Driver code"
Solution in Python:
assistant
#Here is code to find the index of the left pointer after possible moves in the array and the other steps required.
 def getIndex ( a , n ) :
	if ( n == 1 ) :
		return 0
	ptrL = 0
	ptrR = n - 1
	sumL = a [ 0 ]
	sumR = a [ n - 1 ]
	while ( ptrR - ptrL > 1 ) :
		if ( sumL < sumR ) :
			ptrL += 1
			sumL += a [ ptrL ]
		elif ( sumL > sumR ) :
			ptrR -= 1
			sumR += a [ ptrR ]
		else :
			break
	return ptrL
if __name__ == " _ _ main _ _ " :
	a = [ 2 , 7 , 9 , 8 , 7 ]
	n = len ( a )
	print ( getIndex ( a , n ) )