This approach is fairly straightforward, derived from the GMATprep suggested answer:
To minimize the difference in the two numbers, we pick minimum difference in the hundreds digit which is 1. there are 4 combinations:
2-- | 3-- | 7-- | 8--
1-- | 2-- | 6-- | 7--
Next we write down the rest of the available digits for each combination in ascending order:
3,6,7,8 | 1,6,7,8 | 1,2,3,8 | 1,2,3,6
In each combination, our task is to minimize the difference between the two 2-digit numbers (tens and ones).
This can be achieved by choosing the first two available digits in ascending order for the greater number and last two available digits in reverse order for the smaller number.
For example, in the case 2-- , we put, 236 and in the case of 1--, we put 187.
Hope the reason is clear. this is because it will maximize the value of the smaller number and minimize the value of the greater number. hence, the difference is the minimum.
doing so, we get:
236 | 316 | 712 | 812
-187 | -287 | - 683 |-763
-------------------------------
49 | 29 | 29 | 49
Hence the answer is 29. Choice A.