Given a string containing only 0's and 1's and assuming that we can perform left cyclic shift how can we find the permutation that represents the maximum binary number?
The most effective way of doing it.
12/22/2020 1:44:43 PM
I'll duckduckgo that for you :
We can only perform left cyclic shits.
An the problem is to find the maximum binary number obtained with all possible strings obtained after multiple cyclic shifts.
Send us a message