The main repo for all of my files and code for the 42 school

Algorithmic C project for the 42 Paris School

Впихиваем тетраминки из файла в минимально возможный квадрат

Tester for the 42 School's fillit project.

algorithm backtracking

Tetramino

Shell script for Fillit project of 42 (Hive Helsinki)

This was a group project in Hive. We were 2 people in our group. For this project, my contribution mostly on validation and matrix creation to setting up the valid tetros

A program that finds minimum board size for tetrominos.

Solves the puzzle with brute-force

Program who sort tetriminos to find best placement (like Tetris)

Fillit is a tetris piece solver. The solver will calculate the smallest possible square to fit the given pieces and then print the solution.

An algorithm which fits some Tetrominos together into the smallest possible square.

🏫 UNIT Factory (Ukrainian National IT Factory) — Ukraine's only institution that works by innovative standards of French School “42”.

The goal of this project is to fill in a grid of empty spaces. Each valid space is represented by a dot ‘.’ character.

Fillit is a project that let you discover and/or familiarize yourself with a recurring problematic in programming: searching the optimal solution among a huge set of possi- bilities, in a respectable timing.

Algorithm X dancing links solver for fillit puzzle