Summary of chapter 3 of “Grokking Algorithms”. I introduce the concept of recursion and how to think about problems by breaking them into smaller pieces. Classic examples like factorial, plus a look at the risks of stack overflow.

Summary of chapter 2 of “Grokking Algorithms”. It covers the selection sort algorithm and compares arrays and linked lists in terms of operations and efficiency, reinforcing Big O notation.

Summary of chapter 1 of “Grokking Algorithms”. It introduces binary search as the first example and explains the concept of algorithm efficiency using Big O notation in a simple way.

A step-by-step of how I launched my blog using Pelican, GitHub Pages, and a custom theme.

Between diapers, meetings, and dreams, what it’s like to be a mom and a professional at the same time.

Learn how to turn your GitHub profile into a space that shows who you are, with personality, organization, and a touch of care.

I decided to share how I set up my development environment, from the OS installation to the tools and extensions I use every day.

Operating System

I start with a Linux installation. I have a personal guide I follow whenever I need to configure a new machine, maybe I’ll …