How many three digit numbers of distinct digits can be formed by

the best approach to go via rule if a number is divisible by 11 then take every 2nd digit (in our case the 1 in the middle) and subtract it from the sum of the rest digits, if the result is 0 or a multiple of 11 then we are settled
number x1x possible combination 7 and 5 (2 options as it could be 5 and 7)
number x2x possible combination 7 and 6 (2 options)
number x3x possible combination 1 and 2 (2 options)
number x4x possible combination 1 and 3 (2 options)
number x5x possible combination 3 and 2 also 4 and 1 (4 options)
number x6x possible combination 5 and 1 also 4 and 2 (4 options)
number x7x possible combination 5 and 2 also 4 and 3 also 6 and 1 (6 options)
Anyways, I found this question a bit time-consuming, that's the best approach to solve it, however, even using that it took me 3 mins or more, to double-check the responses as all answers are pretty much close to each other

I'm curious what are the odd to get that kind of question on GMAT? (instead of 11 that can be 7 or 13, non-standard divisibility patterns)