Vellamo/fillit

42 Project to place tetrinos in the smallest possible square. For my team's solution, we both decided to explore binary/bit manipulation for the first time. I'm aware of more efficient solutions to the algorithm (that would perform less checks/operations).

Last synced at: about 2 years ago - Stars: 1 - Forks: 0