Minimum number of operations to convert binary string to self-destructing

We will explore algorithms to find the Minimum number of operations to convert a binary string to a self-destructing string.

What is a self-destructing string?

A binary string is called a self-destructing string if it can reduced to an empty string by performing the following operation 0 or more times:

"Choose a valid integer i such that the i-th character of the current string is different from the i 1-th character, and remove these two characters from the string."

The Problem

Given a binary st...