I'm trying to grasp balancing groups. A hypothetical challenge that will help me in another is, how would I find the minimum length section of consecutive same characters in a string?

Can this be done with balancing groups in a single stage?

Input: 3332266666614444 Output: 1. And if the 1 is then removed, the result should be 22.

@mbomb007 so you're looking for the shortest run? that is probably shortest with multiple stages but it can definitely be done with with balancing groups

something like retina.tryitonline.net/…

much shorter solution with multiple stages: retina.tryitonline.net/…

Hmm. Yeah. I was hoping to apply it to my failed Retina solution for the Condensing Strings challenge.