Handle Score
@Ibrahim Nash 6420
@blackshadows 6376
@mb1973 5604
@Quandray 5231
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3413
Complete Leaderboard
Anagram Palindrome
Basic Accuracy: 59.06% Submissions: 215 Points: 1

Given a string S, Check if characters of the given string can be rearranged to form a palindrome. 

Example 1:

S = "geeksogeeks"
Output: Yes
Explanation: The string can be converted
into a palindrome: geeksoskeeg

​Example 2:

S = "geeksforgeeks"
Output: No
Explanation: The given string can't be
converted into a palindrome.

Your Task:
You don't need to read input or print anything. Your task is to complete the function isPossible() which takes the string S as input and returns 1 if the string can be converted into a palindrome. Else, it returns 0.

Expected Time Complexity: O(|S|).
Expected Auxiliary Space: O(Distinct Characters).

1 <= |S| <= 106

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Anagram Palindrome

Output Window