**Akbar\'s Army**\n**Q.** \n\nAkbar has an amry of size n consisting of both footmen and horsemen. He loves to line up his soilders. Akbar feels that the power of his army is the maximum number of consecutive soilders of the same type - footmen or horsemen. He has k reserve horsemen and footmen each. Any soilder in the existing lineup can be replaced by one from the reserve. As the commander-in-chief of his army, Akbar has asked you to arrange his amry so that it has the greatest power.\n\nYou are given a string army consisting of a and b where -: Footmen are represented by a and horsemen are represented by b.\n\nYou have to return the maximum power of army that can be achieved.\n\n**Example 1:**\nInput: n = 8, k = 1, army  = "aabaabaa"\nOutput: 5\nExplanation: Replace one horsemen with one footman from reserve to get power of five consecutive footmen.\n\n**Example 2:**\nInput: n = 4, k = 2, army  = "abba"\nOutput: 4\nExplanation: Replace two horsemen with two footmen or two footmen with two horsemen from reserve.\n\n\n**Here is my code**\nhttps://leetcode.com/playground/XpaLvGdR\n\nThe other question was quite easy , related to tree level order.

Akbar\'s Army\nQ. \n\nAkbar has an amry of size n consisting of both footmen and horsemen. He loves to line up his soilders. Akbar feels that the power of his a