# Maximum sum of a subsequence with no adjacent elements

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/1178/maximum-subsequence-sum-no-adjacents
Source observed: 2026-11-04T23:11:07.937Z
Last checked: 2026-11-04T23:11:07.937+00:00
Indexed: 2026-11-06T04:22:06.344+00:00

---

# Find the maximum sum of a subsequence with no adjacent elements

We provide interview-practice questions through Aced (formerly Exponent). This question concerns an algorithm for finding the maximum possible sum of a subsequence subject to the condition that no two selected elements are adjacent in the original sequence.

## Question details

- **Role:** [Frontend Engineer](https://www.aced.io/questions?role=frontend-engineer)
- **Company:** [Yahoo](https://www.aced.io/questions?company=yahoo)
- **Interview history:** 1 interview; last asked a year ago

Detailed company statistics require an [Upgrade](https://www.aced.io/upgrade?src=questions). To submit an answer, you must [log in or sign up](https://www.aced.io/signup?src=nav&returnPath=/questions/1178/maximum-subsequence-sum-no-adjacents). Submitting marks the question complete.

## Community answers

No answers have been contributed by the community yet.

## Related questions

- [Find the maximum length sub-array with a given sum.](https://www.aced.io/questions/1115/find-maximum-length-sub-array-with-given-sum)
- [Find the maximum subarray sum.](https://www.aced.io/questions/973/maximum-subarray-sum)
- [Given an array of n integers and a number k, find the maximum number of elements whose sum is less than k, and return their sum.](https://www.aced.io/questions/4638/max-elements-sum-less-than-k)

## Related courses

### [Behavioral Interviews: A Practical Guide for Engineers](https://www.aced.io/courses/eng-behavioral)

![Behavioral Interviews: A Practical Guide for Engineers](https://images.ctfassets.net/x78yjrjc11pq/47qcoHjzFZXE37GoacedkB/9d8e3f4910d8b06b21e76745cd9cbff3/AdobeStock_1142146335.jpeg?w=800&h=800&fm=webp&q=75)

We help candidates prepare for senior-plus behavioral interviews at FAANG and Tier-1 companies. The course is made with staff and principal engineers from Meta, Netflix, Google, and more, with guidance on avoiding downleveling, elevating past projects, and communicating naturally.

### [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 companies. The course includes mock interviews, frameworks, and advice from senior candidates, covering data structures, algorithms, system design, people management, behavioral interviews, and more.

## Aced interview-preparation areas

Our accessible course navigation includes preparation for Product Management, Forward Deployed Engineering, Engineering Management, Software Engineering, System Design, Data Science, Machine Learning, Data Engineering, AI Engineering, Investment Banking, Generative AI, Security Engineering, TPM, Solutions Architecture, UX / Product Design, and BizOps & Strategy. We also offer interview questions, practice, coaching, resume review, salary negotiation, job referrals, resources, and related services.

---

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