This is the first round, a coding sample before the phone screen.

I was instructed to use an Online Assessment tool to write code to solve two problems within 60 minutes.

The tool supports many mainstream programming languages and custom test cases.

This is the first OA coding sample from Google. The coding question is:

Given a zero-indexed array A of N integers, return any index P of an element such that the sum of its left elements and the sum of its right elements are equal. The sum of zero elements is assumed to be 0. This can happen if P = 0 or if P = N-1.

For example, for A = {-1, 3, -4, 5, 1, -6, 2, 1}, indexes 1, 3, and 7 are valid outputs.