Great starting point, but I think you could also show some of the time complexity details for the methods in the Stack and Queue and maybe other data structures too. A premisse is that most data structures based on internal array, when adding elements will mostly be O(1), however, whenever we pass the initial capacity of that structure, that operation will become O(n), why? Cracking the Code Interview is a great reference for some of those details. In the sentense "Exists more Data Structures like String, Graphs, Insertion Sort, Bubble Sort, Trees... It's a big list :P", "There are" here would be more common than using "Exists" :) And also Bubble Sort, Insertion Sort, are sorting algorithms to solve problems and not data structures specifically.

The Big O Cheat Sheet is great for reference: bigocheatsheet.com

Great article; well done, Ana Beatriz Neri! Looking forward to reading more of your articles! 🙏