Skip to main content
All Questions

Closest Subarray Sum to Target.

Unlock detailed company stats for this questionUpgrade
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 minimum. You have to answer this for M different values of T.

Community answers

No answers contributed by the community yet.

Related questions

Explain how to find a target sum in an array.

Related courses

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.

Course

System Design Interviews

Learn how to answer the latest system design questions across product, infrastructure, and AI domains. Features in-depth video examples, written breakdowns, and helpful reference patterns. Watch senior engineers and managers answer these questions in mock interview videos.