Candy Crush in 1D (Stabilize by Repeatedly Removing Groups)

bloomberg

Problem: 1D Candy Crush (Repeated Removal Until Stable)

Given a string s consisting of lowercase letters and an integer k.

You may repeatedly perform the following operation any number of tim...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: