InterviewBit Academy is now Scaler!
Learn Tech Skills from Scratch @ Scaler EDGE

Longest Subarray Length


Problem Description

Given an integer array A of size N containing 0's and 1's only.

You need to find the length of the longest subarray having count of 1’s one more than count of 0’s.



Problem Constraints

1 <= N <= 105



Input Format

First and only argument is an integer array A of size N.



Output Format

Return an integer denoting the longest length of the subarray.



Example Input

Input 1:

 A = [0, 1, 1, 0, 0, 1]

Input 2:

 A = [1, 0, 0, 1, 0]



Example Output

Output 1:

 5

Output 2:

 1



Example Explanation

Explanation 1:

 Subarray of length 5, index 1 to 5 i.e 1, 1, 0, 0, 1. Count of 1 = 3, Count of 0 = 2.

Explanation 2:

 Subarray of length 1 will be only subarray that follow the above condition.



NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Longest Subarray Length  on Interview Code Editor
Sign Up
to access hints and editorial solutions for Longest Subarray Length
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions