Uniform or non-uniform string prediction

Akansha has a circular string of length N consisting solely of 0's and 1's. She needs to calculate the number of flips(0-1 or 1-0 transitions) that one has to make while making a single traversal over the string i.e. starting from any character and go circularly until (s)he gets back to the same character. The string is said to be uniform if there are atmost N/2 such flips, otherwise it is c