Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2038. Remove Colored Pieces if Both Neighbors are the Same Color
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source