# Find the minimum sum subarray of size k.

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/1122/minimum-sum-subarray-size-k
Source observed: 2026-11-05T00:28:04.678Z
Last checked: 2026-11-05T00:28:04.678+00:00
Indexed: 2026-11-06T04:44:13.637+00:00

---

# Find the minimum sum subarray of size k.

We provide this coding-interview question in our community question library.

## Community answers

No answers have been contributed by the community yet.

## Related questions

- [Find the maximum subarray sum.](https://www.aced.io/questions/973/maximum-subarray-sum)
- [Find the maximum subarray product](https://www.aced.io/questions/5170/find-the-maximum-subarray-product)
- [Find the minimum window substring.](https://www.aced.io/questions/1687/minimum-window-substring)

## Your answer

Sign in or sign up to answer this question. Submitting an answer marks the question complete.

---

[Read this page’s summary](https://www.aced.io/agents/api/public/v1/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F1122%2Fminimum-sum-subarray-size-k&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%2F1122%2Fminimum-sum-subarray-size-k). Opening a form does not execute a tool.