For N = 9, I got the following result:

4*1738=6952

4*1963=7852

12*483=5796

18*297=5346

27*198=5346

28*157=4396

39*186=7254

42*138=5796

48*159=7632

sum = 56370

I passed all tests except the last one. Can someone please tell me what's going wrong here?

ive used brute force approach to solve this and got timeout in testcase 5 can anyone explain it

what is the upper limit of the numbers to be considered for multiplicand and multiplier ?

passed all the test cases

import re
set1=set()
sum=0
n=int(input())
for i in range(1964,1,-1):
    for j in range(100):
        if j not in set1:
            value=i*j
            str1=str(value)+str(i)+str(j)
            if value not in set1 :
                matcher=''.join(str(k) for k in range(1,n+1))             
                if(re.fullmatch(matcher,''.join(sorted(str1)))):
                    sum=sum+value                   
                    set1.add(value)
                    
print(sum)

i am getting error for numbers greater than 7 i am using the permutation function.any help will be appericiated

i am getting sum as 0 for n=7. is it correct? my test case 4 is only failing

what we have to add to get the sum becase i am simply breaking the loop .

Could you please tell me what is the logic here?

nicely done Let's say i*j=k is pandigital then for N=5 i=1 j=2 k=2 (number of digits) N=6 i=1 j=2 k=3 and so on ... upto N=9

Is there any way other than brute force??