โ† Microsoft questions

Minimum cost to delete adjacent duplicate characters

Filed under Microsoft

Given a string s and an array cost where cost[i] is the cost to delete s[i], find the minimum cost to delete characters such that no two adjacent characters in the remaining string are identical.

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 Microsoft questions

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