godwinaustin's blog

Need help with this question on hackerearth !
By godwinaustin, history, 8 years ago, In English

https://www.hackerearth.com/practice/data-structures/arrays/1-d/practice-problems/algorithm/battlefield-13/description/

  • Vote: I like it
  • -9
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
8 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

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.

→ Reply