Simply keep frequency of each character of left and right side. Make an array of size 26 and update it for each character found in left and right side.
You can see this CodeChef: Practical coding for everyone
as you are adding both half sides and checking weather it’s sum is equal or not.
But this is wrong approch because for eg try : ‘decf’ as input in your code will O/P “YES”
but the string ‘decf’ is not lapindrome.
This is because Ascii values of d & e are 100 & 101 : sum is = 201.
and Ascii values of c & f are 99 & 102 : sum is = 201.
I think this will help you.