40414243444546

# find the longest subarray with equal 0s and 1s (naive O(n^2))
def find_sub_array(nums: list[int], n: int) -> int:
    # cumulative sum for current subarray (0 -> -1, 1 -> +1)
    s = 0
    # best length found and a start index holder
    maxlen, startindex = -1, -1

    # pick each start index i
    for i in range(0, n - 1):
        # initialize sum for subarray starting at i
        s = -1 if nums[i] == 0 else 1

        # extend subarray to the right from j = i + 1
        for j in range(i + 1, n):
            # update sum using -1 for 0, +1 for 1
            s += -1 if nums[j] == 0 else 1

            # check if current subarray has zero sum
            if s == 0 and maxlen < j - i + 1:
                # update best length
                maxlen = j - i + 1
                # record start index (not printed, kept to mirror logic)
                startindex = i

    # print result or no-solution message
    if maxlen == -1:
        print("No such subarray")
    else:
        print(f"The length of the longest subarray is: {maxlen}")

    # return best length
    return maxlen

# driver code
def main():
    # input array
    arr = [1, 0, 0, 1, 0, 0, 1]
    # size of array
    size = len(arr)

    # invoke computation
    find_sub_array(arr, size)

# run main
if __name__ == "__main__"

12345678910111213141516171819202122232425262728293031323334353637383940

// find the longest subarray with equal 0s and 1s (naive O(n^2))
function findSubArray(nums, n) {
    // cumulative sum for current subarray (0 -> -1, 1 -> +1)
    let sum = 0;
    // best length found and a start index holder
    let maxlen = -1, startindex = -1;

    // pick each start index i
    for (let i = 0; i < n - 1; i++) {
        // initialize sum for subarray starting at i
        sum = (nums[i] === 0) ? -1 : 1;

        // extend subarray to the right from j = i + 1
        for (let j = i + 1; j < n; j++) {
        // update sum using -1 for 0, +1 for 1
        sum += (nums[j] === 0) ? -1 : 1;

        // check if current subarray has zero sum
        if (sum === 0 && maxlen < j - i + 1) {
            // update best length
            maxlen = j - i + 1;
            // record start index (not printed, kept to mirror logic)
            startindex = i;
        }
        }
    }

    // print result or no-solution message
    if (maxlen === -1)
        console.log("No such subarray");
    else
        console.log("The length of the longest subarray is: " + maxlen);

    // return best length
    return maxlen;
}

// driver code
function main() {
    // input array
    const arr = [1, 0, 0, 1, 0, 0, 1];
    // size of array
    const size = arr.length;

    // invoke computation
    findSubArray(arr, size);
}

// run main
main();

Complexity Analysis