The current issue's new challenge involves the development of two sequence processing algorithms. The naïve challenge solutions require repeated "passes" over the sequence. The problem-solver's challenge is to reduce the number of passes as much as possible, perhaps even into only one pass. Following the presentation of the new challenge, we present the solution of the previous column's Separating Between Foes challenge. The elegant solution of this challenge embeds an approach that is useful and employed in various algorithmic tasks.
/lp/association-for-computing-machinery/colorful-challenges-kangaroo-hops-i7skxr0Xwg