← Arcesium questions

Maximum moves by removing coin X and neighbors X-1, X+1

Filed under Arcesium

Given N distinct coins with values, in one move you can pick a coin of value X and remove it along with any existing coins of value X-1 and X+1. Find the maximum number of moves or points you can…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Arcesium questions

Collected from public candidate posts and coding forums. Updated Nov 2026.