Magically Equal (keteki)

CodeChefOpen on judge ↗

Two arrays are given, each containing equal number of a few four digit numbers. Two numbers are "magically equal" if they contain the same digits (in equal count, in any order). Print the number of ways in which all the numbers in both the arrays are "magically equal", irrespective of the index positions of the numbers in its respective array. Example for more clarity: Lets say First array = {A

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