\[\begin{array}{ccccccc} & & G & H & I \\ + & & J & K & L \\ \hline & & M & N & O \\ \end{array}\]

The above represents a cryptogram such that each letter represents a *distinct* single digit non-negative integer. Find the number of solutions of the above cryptogram.

**Note:** \(G\) and \(J\) are non-zero.

Also see Part 1

×

Problem Loading...

Note Loading...

Set Loading...