Status
Upcoming
1
Hike — Vallée de la Mérantaise
Domaine d'Ors and the Vallée de la Mérantaise trail near Chevreuse. ~14km loop through the forest.
To Do
2
Concurrent and Distributed Systems
Follow University of Cambridge course — ConcDistSys. Covers mutual exclusion, consensus, replication, and Byzantine fault tolerance.
Resume Update
Incorporate Forest BD Viewer project, EPITA coursework, and recent backend experience. Tailor for Stage PFE applications.
In Progress
5
Advent of Code 2025
Working through daily algorithmic puzzles in Go. Focusing on graph traversal and dynamic programming.
10 / 25 days
Leetcode Streak
Maintaining a daily problem-solving streak. Currently focusing on trees, graphs, and sliding window patterns.
58 days streak
MIT 6.824 Distributed Systems
Currently on Lecture 3: GFS. Working through the labs — implementing MapReduce and Raft consensus.
Lecture 3 / ~20
MIT 6.006 (2020)
Introduction to Algorithms. Currently at Lecture 12: Binary Heaps — covering priority queues and heap sort.
Lecture 12 / ~30
MIT 6.006 (2009)
Supplementary viewing for alternative explanations. Currently on Lecture 9: Table Doubling, Karp-Rabin hashing.
Lecture 9 / ~26
Done
3
Portfolio Website
Built this retro-styled portfolio from scratch. Vanilla HTML/CSS/JS, self-hosted fonts, dark mode, keyboard navigation, Leaflet map.
Forest BD Viewer
Full-stack GIS app for French forest biodiversity data. Go + GraphQL + PostGIS + Next.js with Mapbox GL.
MIT 6.824 — Lab 1: MapReduce
Implemented a distributed MapReduce system in Go with coordinator/worker architecture and fault tolerance.