How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Take-home Project rounds at SIG (Susquehanna).

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at SIG (Susquehanna) during technical interviews.

Count subarrays with odd zero count

Last updated: Mar 29, 2026

Quick Overview

This question evaluates array-processing and combinatorial counting skills, focusing on reasoning about parity of element occurrences and efficiently counting qualifying contiguous subarrays.

Medium
SIG (Susquehanna)
Coding & Algorithms
Software Engineer

SIG (Susquehanna)

Aug 8, 2025, 12:00 AM

Software Engineer

Take-home Project

Coding & Algorithms

Given an integer array nums, return how many contiguous subarrays contain an odd number of zeros. Provide an O(n) solution (e.g., using prefix parity counts of zero occurrences) and state its time and space complexity. Example: nums = [0, 0, 1, 0, 1] -> 4.

Submit Your Answer

Loading comments...

Browse More Questions

More Coding & Algorithms•More SIG (Susquehanna)•More Software Engineer•SIG (Susquehanna) Software Engineer•SIG (Susquehanna) Coding & Algorithms•Software Engineer Coding & Algorithms