forked from root/public
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
…
|
||
---|---|---|
.. | ||
audit | ||
badexample00 | ||
badexample01 | ||
badexample02 | ||
badexample03 | ||
badexample04 | ||
badformat | ||
goodexample00 | ||
goodexample01 | ||
goodexample02 | ||
goodexample03 | ||
hardexam | ||
README.md |
README.md
tetris-optimizer
Objectives
Develop a program that receives only one argument, a path to a text file which will contain a list of tetrominoes and assemble them in order to create the smallest square possible.
Instructions
The program must :
- Compile successfully
- Assemble all of the tetrominoes in order to create the smallest square possible
- Identify each tetromino in the solution by printing them with uppercase latin letters (
A
for the first one,B
for the second, etc) - Expect at least one tetromino in the text file
- In case of bad format on the tetrominoes or bad file format it should print
ERROR
- The project must be written in Go.
- The code must respect the good practices.
- It is recommended to have test files for unit testing.
Allowed packages
- Only the standard go packages are allowed
Example of a text File
#...
#...
#...
#...
....
....
..##
..##
- If it isn't possible to form a complete square, the program should leave spaces between the tetrominoes. For example:
ABB.
ABB.
A...
A...
Usage
$ cat -e sample.txt
...#$
...#$
...#$
...#$
$
....$
....$
....$
####$
$
.###$
...#$
....$
....$
$
....$
..##$
.##.$
....$
$
....$
.##.$
.##.$
....$
$
....$
....$
##..$
.##.$
$
##..$
.#..$
.#..$
....$
$
....$
###.$
.#..$
....$
$ go run . sample.txt | cat -e
ABBBB.$
ACCCEE$
AFFCEE$
A.FFGG$
HHHDDG$
.HDD.G$
$
This project will help you learn about:
- The use of algorithms
- Reading from files