Penultimate project before branching out.
Given an array of Tetrominos, the programme will return the smallest square that would contain all the Tetrominos.
Example input:
....$
##..$
.#..$
.#..$
$
....$
####$
....$
....$
$
#...$
###.$
....$
....$
$
....$
##..$
.##.$
....$
Output:
DDAA$
CDDA$
CCCA$
BBBB$
Where 'A', 'B', 'C' and 'D' represent the order of the Tetrominos.