Make a minimal and maximal 2-digit number from digits of two 3-digit numbers
Husk, 15 14 13 9 bytes
§,▼▲f←ṁP*

Try it online!
Takes two input arrays, outputs pair (min,max).
-1 byte from Dominic Van Essen.
-1 more byte from Dominic Van Essen (after some more struggling).
-4 bytes taking arrays of digits as input.
Explanation
§,▼▲f←ṁP*
        * cartesian product pairs of the inputs
      ṁP  map each to permuations, and flatten the list
    f←    remove elements where first digit is falsy(&lt;10)
§,        create pair with
  ▼▲      minimum and maximum