All Questions
Tagged with lights-out algorithm
1
question
9
votes
3
answers
940
views
Minimum number of flips needed to fully set a binary string
Source: My school teacher, it was just given as a problem statement.
Problem: You are given a binary sequence $S$ of up to $10^6$ bits. You wish to set all the bits in the string to $1$, but the catch ...
- 103