Iterate over all sub arrays of size k(include n->k-1 for the circle) where k is total number of knights.Check the minimum swaps(number of non-knights) needed in each subarray.There are O(n) such sub arrays.Rather than iterating you can maintain prefix count of number of knights.