# Solution Alignment The prompt asks for an implementation-level answer. The safest way to present it is to define the state, maintain clear invariants, then walk through complexity and tests. ## Problem Restatement Given an integer array nums and an integer target, implement: ( 1) a function that returns true if any non-empty contiguous subarray sums to target; ( 2) a function that returns the number of contiguous subarrays whose sum equals target; ( 3) assuming all numbers in nums are non-negative, design an O(n) time, O( 1) extra-space method to find one such subarray (return its start and end indices) and explain how to adapt it to count all such subarrays. For ( 1) and ( 2) also aim for O(n) time. Discuss trade-offs, edge cases (e.g., zeros, negative numbers, large inputs), and prove correctness. ## Recommended Approach Start with a brute-force baseline to confirm correctness, then identify the repeated work or ordering property that enables a better data structure such as a hash map, heap, stack, queue, two pointers, prefix sums, BFS/DFS, or dynamic programming. Write the implementation around a small invariant and test that invariant directly. ## Correctness The implementation should maintain an invariant after each loop or operation that directly matches the problem statement. At termination, that invariant implies the returned value has considered every valid candidate exactly once, or has preserved the required data-structure state after every API call. ## Complexity State the baseline complexity and the optimized complexity. For most interview constraints, justify why the optimized approach meets the expected input size. ## Edge Cases and Tests Empty and singleton inputs, duplicates, ties, invalid inputs, boundary values, and tests that exercise the main invariant.