It seems like an easy problem. But somehow, I am getting a WA. I can't seem to figure out why. Please have a look
A description of my algorithm - Made two arrays A[26] and a[26] for storing the count of upper case and lower case alphabets, respectively. Then traversed through the arrays, adding to the result the sum of element mod 2 and of element/2.