I will not go deep dive into all the concepts, all the data structures mentioned here is very complex, but it will help you to have an introduction and understand the approaches, it's like a guide using my personal annotations and I hope that helps y...
Markdown supported · ⌘↵ to post
Ana Neri
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
Luísa Ribeiro Bezerra
Software Engineer
Great, Ana <3 I'm happy to see more people using this phenomenal blog platform :) keep posting, girl!