Maximize Last Remaining Robot Value
Filed under Nutanix
The question
There are N robots arranged in a line, each assigned an integer value. Any robot can terminate an immediately adjacent neighbor to its left or right. When a robot with value x terminates a robot with value y, the surviving robot's value becomes x - y and the other robot disappears. Robots eliminate each other until only one remains. Find the maximum possible value of the final robot.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.