Medium
MetaGoogle

Count Contiguous Runs Summing to a Target Coding / DSA Interview

Given a sequence of integers (possibly negative) and a target sum, count how many contiguous subarrays sum exactly to the target.

1. Problem Statement

You are given an array of integers and a target sum. Count the number of contiguous subarrays whose elements sum to the target.

2. Live Coding Format

Work in the provided coding workspace while explaining your decisions to the live interviewer. Validation may use inline tests, examples, comments, or a verbal walkthrough.

3. Key Focus Areas

  • 1
    Problem clarification and contract
  • 2
    Approach exploration and optimality
  • 3
    Think-aloud communication and pacing
  • 4
    Implementation correctness
  • 5
    Code quality and language fluency
  • 6
    Handwritten tests and dry run
  • 7
    Debugging and self-correction
  • 8
    Complexity analysis
  • 9
    Follow-up performance

4. What Strong Candidates Should Demonstrate

  • Clarify sign, size, and zero-sum assumptions before coding.
  • Explain a brute-force baseline and improve to a prefix-sum with hash map frequency count.
  • Think aloud while implementing readable, correct code.
  • Validate with explicit expected outputs and a top-to-bottom handwritten dry run.
  • Analyze time and space complexity and handle a bounded follow-up modification.

Want interactive feedback?

Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.

Continue to Dashboard

Core Concepts

ArraysHash MapsPrefix SumsComplexity Analysis

Continue preparing

Build a complete software engineer mock interview plan

Related Coding / DSA

Find a Pair Matching a Target

Given a sequence of integers and a target value, return the positions of two distinct entries whose values add to the target.

Related Coding / DSA

Longest Strictly Increasing Subsequence

Given a sequence of integers, find the length of the longest subsequence (not necessarily contiguous) whose elements are strictly increasing.