Lexicographically Largest String via State Flips

Question

Build a length-m string by repeatedly picking the largest currently-available element. After each pick, every `0` directly to the right of a `1` in the state mask flips to `1`, unlocking more elements...

Amazon interview candidates · Answer

Community-reported Amazon interview question with 1 related discussion. The full write-up and related discussions are available to members.

Comments