Official algorithmic problem description and constraints.
You are given a binary string S of length N, representing the attendance sheet of Alice.
For the days when Alice went to school, Si=1, otherwise, Si=0
Alice wanted to increase her attendance. She can perform the following operation at most once :
You need to find the maximum number of days Alice will be marked present after performing the operation at most once .
Detailed video explanations, mathematical intuition, and clean C++ implementation code.