Return to Answer

deleted 46 characters in body

edited Mar 8, 2023 at 17:37

Haskell, 14094 bytes

candyCrushS xs =f casexs=case break ((>= 3>=3) . length) $ group$group xs of {(ys, []) -> concat ys >concat ys;(ys, zs) -> candyCrushS $ concat >f$concat(ys <> dropys<>drop 1 zs)}

Haskell, 140 bytes

candyCrushS xs = case break ((>= 3) . length) $ group xs of (ys, []) -> concat ys  (ys, zs) -> candyCrushS $ concat (ys <> drop 1 zs)

Haskell, 94 bytes

f xs=case break((>=3).length)$group xs of{(ys,[])->concat ys;(ys,zs)->f$concat(ys<>drop 1 zs)}

Source Link

answered Feb 28, 2023 at 16:15

F. Zer

Haskell, 140 bytes

candyCrushS xs = case break ((>= 3) . length) $ group xs of (ys, []) -> concat ys (ys, zs) -> candyCrushS $ concat (ys <> drop 1 zs)