Pergunta de entrevista da empresa Axon

A recursive DP problem. Given a string perform two operations and minimize the total number of changes