Get Min Move

Get Min Move is an Ibm interviews coding interview problem. Given a lowercase string, a move selects an index and deletes the first same character to its left and to its right (if present). Determine the minimum number of moves to achieve the minimal possible string length and return that integer. A clear interview question focused on string operations.

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Input Variables
Execution Result: