Question

Number of ways to permute n digits such that sum is divisible by 3

Answer 1

Given an integer N. The task is to check whether any of its permutations is a palindrome and divisible by 3 or not.

Examples :

Input : N = 34734 Output : True
Input : N = 34234 Output : False

$<b>HOPE IT HELPS U IF YEAH PLZ MARK IT AS BRAINLIEST$ ✌️❣️