Anagram

CodeChefOpen on judge ↗

Guru W loves to solve Anagrams and has decided to take part in the National Anagram Solving Championships. He wants to devise a method by which he can solve anagrams quickly and is looking to you for help. Input For each test case take two strings X and Y such that 1 Output If Y is an anagram of X print “Anagram”, else print “Not Anagram” Example Input: 1. Leonardo Da Vinci O Draconian Devil

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