Leetcode 2038. Remove Colored Pieces if Both Neighbors are the Same Color

Two players alternately delete a non-edge piece whose neighbors are the same color (Alice deletes 'A', Bob deletes 'B'); determine if Alice wins under optimal play. The core challenge is to analyze runs of consecutive identical letters and compare how many interior removable pieces each player can make.