Actually it is most of the time. If the array doesn't have more space, it doubles it and you have to copy the array to the new one and that's O(n), so sometimes the append method isn't always O(1) 2024-10-19T01:58:00.837Z+00:00 ... The list is an inbuilt data structure in python. More on stackoverflow.com

A "data structure" is a way of organizing information (i.e.: collections of data) Real/Physical world examples: * A list where you add your friend's name and phone number and any other notes one by one as you get them. * A "Contacts" book where you add your friend's names but put them in the appropriate alphabetical section. * A "Rolodex" (or box of index cards) where each person get's their own card. * A grid of columns and rows you draw on graph paper where all names are in the same column, etc. Each of these is a different way to organize or structure the data. AKA: A different data structure. Each has advantages and disadvantages. * Some are easier to get started with (implement). Like the list. * Some are easier to find a name quickly (like the contact book) * Some are easier to add a new person in the middle (like the Rolodex/Index Cards) * Some take up more physical space and are harder to carry around (Like the Rolodex) You choose which to use based on your own criteria. Do you have a small number of people so a little list of 10 is fine? Do you have a large list of people (like 100) where a list would be unwieldly so you buy a little contacts book with alphabetic tabs on the side? Do you add and remove people frequently (like in a business) where a Rolodex is better? Do you need to take the numbers with you (like when you go on vacation) so a little book is better? Or do you only need the numbers when at your desk at work, where a big fat Rolodex is fine?? As far as the built in strings, integers, Booleans, etc.: Programmers generally call those data types, not data structures. Are they technically little data structures? Yeah, maybe. But it's not worth worrying about. Just call those data types and the bigger things data structures. More on reddit.com

Common data structures https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions Common patterns https://github.com/cl2333/Grokking-the-Coding-Interview-Patterns-for-Coding-Questions More on reddit.com

It's great that you want to learn more outside of class. Off the top of my head a good starting place is array, linked list, stack, queue, heap, (un)balanced tree, hash map, priority queue. I would suggest trying to implement each of these yourself if possible a good way to ensure that you understand whats going on. The balanced search tree and hash map are particularly useful to understand. AVL, Red-Black, and 2-3 are different varieties of balanced trees. Priority queue can be implemented with a heap, an augmented tree, or a skip list each implementation has its own pros and cons.

Edit: This GitHub page has a pretty extensive compilation of resources on data structures and algorithms. The guy who made it was a self taught developer who created it to prepare for interviews and ended up landing a job at Amazon.

More on reddit.com