412. Fizz Buzz

Problem Description

You are given an array arr which consists of only zeros and ones, divide the array into three non-empty parts such that all of these parts represent the same binary value.

Example 1:

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

Solution

C#

code example ##To blow your mind!!!
Is this working?

Link to demo with User Interface

JavaScript


  function addSum(int1, int2){
    let result = int1 + int2;
    return result;
}