title: In a binary circular array of length n,find if it can be partitioned such that most groups of adjacent elements of size m have more 1s than 0s
body: <p>For example,if array is
  001101100
  there exists a partition
  011 011 000
  where maximum groups have more 1s than 0s.
  However,in
  100110100
  there isnt.
  I have tried brute force approach which takes O(n^3) time. Please suggest a more efficient approach,as that is not working.</p>