AceStack AI

Coding (Algo)

Minimal Sync Deletions

Algorithm: Dynamic programming Difficulty: Hard Time: 60 minutes

Goal

Return the minimum total number of deletions needed to make the histories identical.

What this task practices

Minimal Sync Deletions is a coding (algo) interview exercise that trains prompt interpretation, explicit assumptions, a concrete response, and a clear explanation of tradeoffs. The catalog marks it as hard difficulty. It focuses on Technical Reasoning, Testing, Validation. The signed-in workspace provides the tools for the round and evaluates the attempt against task-specific criteria. Reference solutions, hidden checks, evaluator instructions, and candidate work remain private.

Sign in to startThe workspace and evaluation open after sign in.