Max sum non-adjacent elements, Rearrange linked list, Shift BT nodes
Filed under Josh Technology
The question
Find the maximum sum of non-adjacent array elements, re-arrange a linked list based on index subtraction from ends, and shift all nodes of a binary tree to the right filling empty places from the rightmost side.
No write-up yet. Related questions below have one.
Related Josh Technology questions
Collected from public candidate posts and coding forums. Updated Nov 2026.