Problem 2767 · Medium

Partition String Into Minimum Beautiful Substrings

A substring is beautiful when it is a binary number with no leading zero that equals a power of 5; a shortest-path style table finds the fewest pieces.

Open the interactive visualisation