String Anagram

CodeChefOpen on judge ↗

Alice Challenged Chef to solve a problem. The problems is described as follows: Chef is given two Strings, chef needs to find if the two given Strings are Anagram of each other. If the given Strings are not anagram of each other then find the lexicographically smallest palindromic string that can be appended to any of the given string so that they becomes anagrams of each other. If it is impossi

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI