CodingReported in a candidate post, Oct 2024
Max subsequence sum without adjacent elements
Filed under Paltech
The question
Find the maximum sum of a subsequence in an array such that no two elements are adjacent.
No write-up yet. Related questions below have one.
Related Paltech questions
Collected from public candidate posts and coding forums. Updated Nov 2026.