Related Coding / DSA
Count Contiguous Runs Summing to a Target
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 a list of integers and a target. Return the indices of two different entries whose values 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
- 1Problem clarification and contract
- 2Approach exploration and optimality
- 3Think-aloud communication and pacing
- 4Implementation correctness
- 5Code quality and language fluency
- 6Handwritten tests and dry run
- 7Debugging and self-correction
- 8Complexity analysis
- 9Follow-up performance
4. What Strong Candidates Should Demonstrate
- ✓Clarify input, output, uniqueness, and no-solution behavior before coding.
- ✓Explain a baseline approach, identify its bottleneck, and select an optimal conventional solution.
- ✓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 pace the easy core problem to leave room for a coding follow-up.
Want interactive feedback?
Practice this problem in the live coding workspace while the interviewer probes your clarification, implementation, trade-offs, and validation.
Continue to DashboardCore Concepts
ArraysHash MapsComplexity AnalysisEdge Cases
Continue preparing
Build a complete software engineer mock interview plan
Related Coding / DSA
Group Words by Letter Composition
Given a list of lowercase words, group together the words that share the exact same multiset of letters.
Related Coding / DSA
Longest Run of Non-Repeating Characters
Given a string, find the length of the longest contiguous substring in which no character repeats.
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.