Ignore Sections

Problem Overview

• This problem asks you to exclude sections in an array that start with 1 and end at the next 0 (spanning consecutive 1s until a 0), then return the remaining numbers and their sum.
• Input: List[int] with 1 ≤ length ≤ 1e5 and elements in [-1e9, 1e9]; Output: (filtered list, sum).
• Relevant to data cleaning or stream/log processing where 1/0 mark masked segments to ignore before aggregation.
• Asked in Apple interviews; a common coding interview challenge and interview question.