# Closest Subarray Sum to Target — coding interview question

Aced (formerly Exponent) publishes a public search API over its indexed pages; the guide is at https://www.aced.io/agents/agent-access.

Source: https://www.aced.io/questions/5556/closest-subarray-sum-to-target
Source observed: 2026-11-05T00:21:32.956Z
Last checked: 2026-11-05T00:21:32.956+00:00
Indexed: 2026-11-07T00:06:57.813+00:00

---

# Closest Subarray Sum to Target.

We host this coding interview question in our questions library. It concerns data structures and algorithms for a **Software Engineer** role and is associated with **Media.net**.

## Problem

You are given an array `A` of `N` numbers and a number `T`. Find a segment `(i..j)` of `A` such that:

`| |Ai + A(i+1) + ... + Aj| - T|`

is minimized. You must answer this for `M` different values of `T`.

## Question details

- **Interview category:** [Data Structures & Algorithms](https://www.aced.io/questions?type=algorithms)
- **Additional category:** [Coding](https://www.aced.io/questions?type=coding)
- **Role:** [Software Engineer](https://www.aced.io/questions?role=swe)
- **Company:** [Media.net](https://www.aced.io/questions?company=media-net)
- **Reported last asked:** a year ago
- **Interview data:** 1 interview

Sign in or create an account to answer this question. Submitting an answer marks the question complete. Detailed company statistics are available through [Upgrade](https://www.aced.io/upgrade?src=questions).

## Community answers

No community answers have been contributed yet.

## Related question

- [Explain how to find a target sum in an array.](https://www.aced.io/questions/1439/find-target-sum-array)

## Related courses

### [Software Engineering Interview Prep](https://www.aced.io/courses/software-engineering)

![Software Engineering Interview Prep](https://images.ctfassets.net/x78yjrjc11pq/4VkuYewBHUFIVUS5oJDW5h/02e833439b1289f25f38f13f81cbdca3/adobe_stock_optimized.jpeg?w=800&h=800&fm=webp&q=75)

We help candidates prepare for software engineering roles at Google, Amazon, Microsoft, Meta, Apple, and other top companies with mock interviews, frameworks, and advice from senior candidates. The course covers data structures, algorithms, system design, people management, behavioral interviews, and more.

### [System Design Interviews](https://www.aced.io/courses/system-design-interviews)

![System Design Interviews](https://images.ctfassets.net/x78yjrjc11pq/78x7miFZFjBCrM5GqftrMJ/2f6d26e632c4e7265c49f6a180227edb/system_design_track_compressed_26ac98a46e__281_29_5be2280f31.jpeg?w=800&h=800&fm=webp&q=75)

We teach candidates how to answer current system design questions across product, infrastructure, and AI domains through in-depth video examples, written breakdowns, reference patterns, and mock interview videos featuring senior engineers and managers.

## Your answer

Use the answer area to submit a response. You must log in or sign up before answering.

---

[Read this page’s summary](https://www.aced.io/agents/api/public/v1/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F5556%2Fclosest-subarray-sum-to-target&trace=t_679ff9ab98f3)

## Ask a follow-up about this page

Need a more specific answer? Ask the exact question you have. It returns a fresh, cited answer from Aced (formerly Exponent)’s knowledge base. No account or API key required.

Open this URL with your own question, URL-encoded. Include your question in q. All research inputs are optional; no account or setup.

`GET https://www.aced.io/agents/agent/faq?q={question}&trace=t_679ff9ab98f3`

[Tool guide and examples](https://www.aced.io/agents/agent-access) · [OpenAPI](https://www.aced.io/agents/api/public/v1/openapi.json) · [Page TLDR form](https://www.aced.io/agents/agent-tools/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F5556%2Fclosest-subarray-sum-to-target). Opening a form does not execute a tool.