Maximum XOR Length

Viper has mastered full stack web development and he wants to master the CP (competitive programming). So he commenced solving CP questions. Viper hates the questions which include bitwise operations as he thinks they're a headache for solving.

While solving he encountered a query totally based on bitwise operation. He isn't inquisitive about solving, so he asks his pal (that is you) to clear up the hassle for him.

You're given a binary string ( consisting of 0's and 1's.) of length n. You need to return the maximum length of the substring such that the XOR of the characters of that substring is maximum.

Substring : A substring s[l, r] (1 ≤ l ≤ r ≤ n) of string s = s₁s₂....s_n is string s_ls_l+1....s_r.

Constraints

• 1 <= n <= 10⁵
• s = {0, 1}

Company Tags