← All problemsSign in

3848. Check Digitorial Permutation

LeetCodeMathCountingOpen on judge ↗

You are given an integer n. A number is called digitorial if the sum of the factorials of its digits is equal to the number itself. Determine whether any permutation of n (including the original order) forms a digitorial number. Return true if such a permutation exists, otherwise return false. Note: - The factorial of a non-negative integer x, denoted as x!, is the product of all positive int

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

Sign in to chat with the tutor and save your progress.

Sign in to start