Cyclic Binary String Problem Statement Given a binary string of length , you can cyclically shift this string any number of times. For example, consecutively applying cyclic shift operation to the binary string “1011010” you will get “0101101”, “1010110” and so on. Let X be the decimal representation of string . Find the greatest power of 2 with which X can be divisible with, if it can be divisible with… Read More »HackerRank Hackfest-2020