Solving Three Equal Parts in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

  • All three parts have equal binary value.

Example 1:

Input: [1,0,1,0,1]
Output: [0,3]

Example 2:

Input: [1,1,0,1,1]
Output: [-1,-1]

Note:

  1. 3 <= A.length <= 30000

  2. 3 <= A.length <= 30000

See the full details of the problem Three Equal Parts at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go