A program that find the smallest possible square to fill tetriminos.
Run make to create fillit executable. As an argument, file containing tetriminos is passed and result is smallest square that fits all pieces. Each tetrimino is represented as letters to understand which piece is which.
Following input file consists of tetriminos to be put within a square.
After running
./fillit map
the output is the following square
