Company: Bookings holding_25july
Difficulty: medium
Palindrome Check Problem Description You are given a string S of length N. The string is comprised of only lowercase alphabets. You have to check whether any anagram of this string is palindrome. If it is a palindrome anagram exists, print 'YES' or 'NO' (without quotes). Input Format The first line contains an integer N, and N is the length of the string. The second line contains the String S. Output Format Output 'YES' or 'NO' depending on the existence of the palindromic anagram. Examples Example 1: Input: N = 5, S = abcab Output: YES Explanation: The anagram 'abcba' is palindromic. So, the answer would be YES. Example 2: Input: N = 5, S = aaaaa Output: YES Constraints 1 <= N <= 10 5 'a' <= S[i] <= 'z'