The 4th assignment for AUT's Advanced Programming course (Spring 2025), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search ...

Solves a N-Dimension Puzzle with one of the 4 different path algorithms : Breadth 1st Search, Depth 1st Search, Best 1st Search and A* Search.