Skip to content
View pauldahacker's full-sized avatar
4 followers · 6 following

Block or report pauldahacker

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Maximum 250 characters. Please don't include any personal information such as legal names or email addresses. Markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
pauldahacker/README.md

Hi! I'm Paul de Mascarel

I'm a 42 student who finished the Common Core at 42 Barcelona.

pde-masc's 42 stats

I'm currently living in Istanbul, Türkiye.

What I'm looking for

I'm passionate about many sides of programming: from using mathematics to build efficient, elegant algorithms and visual experiences, to exploring the depths and art of low-level systems.

I enjoy projects that challenge both logic and creativity, especially in advanced algorithms, graphics/game development, and Unix/low-level programming. I’m also excited to continue exploring cybersecurity and expanding my experience in web and mobile development.

💼 Open to internships, part-time work, collaborations, freelance work, and remote opportunities

My favourite projects at 42

A full-stack multiplayer Pong game built as the final project of the 42 Common Core.

Developed with Fastify (Node.js), TypeScript, Tailwind, and an SQLite microservice architecture, the project combines gameplay, user management, modern web design, blockchain integration, and 3D graphics.

A 3D graphics engine that uses raycasting to create a pseudo-3D environment from a 2D map.

The engine casts rays from the player's position in different directions to determine wall distances and render the 3D scene.

A high-performance sorting algorithm.

The goal is to sort a stack of integers the most efficiently using a set of limited operations, and the help of only one other stack. For minimum points, we must sort 100 random numbers with < 700 operations. For maximum points, we must additionally sort 500 random numbers with < 5500 operations. I managed to make an algorithm inspired by quicksort which sorts 100 numbers in ≈ 625 operations and 500 numbers in ≈ 4800 operations!

Skills

Languages: C, C++, TypeScript, JavaScript, Shell (Bash), Makefile

Web: HTML, CSS, React, Node.js, Tailwind CSS

Databases: MySQL, MariaDB, SQLite3

Systems & Environments: Linux, Unix, Low-Level Programming

Tools: Git, Docker, VS Code

Contact me

Popular repositories Loading

  1. transcendence transcendence Public

    JavaScript 2

  2. FdF FdF Public

    The goal is to build a wireframe 3D landscape viewer in C using a basic graphics library called MiniLibX.

    C 1

  3. push_swap push_swap Public

    The goal is to sort a non-repeating stack of integers the most efficiently possible using a set of limited operations, and the help of only one other stack.

    Shell 1

  4. minitalk minitalk Public

    The goal is to build a simple client-server model where messages are sent from the client to the server using only Unix signals (SIGUSR1, SIGUSR2).

    C 1

  5. minishell minishell Public

    The goal is to build a simplified Unix shell written only in C that replicates shell features like parsing, piping, redirection, and built-in commands.

    C 1

  6. cub3d cub3d Public

    The goal is to use raycasting to create a pseudo-3D environment from a 2D map, using the MiniLibX.

    C 1 1