Data Structures and Algorithms for Beginners

Data Structures and algorithms for beginners. Ace your coding interview. Watch this tutorial to learn all about Big O, arrays and linked lists!

✋ Stay connected:

💡 What you'll learn:
- Big O notation for analyzing code efficiency.
- How to implement and use arrays.
- The basics of linked lists.

👉 This tutorial is perfect for you if:
- You're preparing for technical job interviews.
- You want to improve your coding fundamentals.
- You're a CS student learning these concepts.

Let's get started!

📖 TABLE OF CONTENT
0:00:00 Intro
0:01:04 What is Big O?
0:03:03 O(1)
0:04:32 O(n)
0:08:17 O(n^2)
0:10:41 O(log n)
0:13:20 O(2^n)
0:14:10 Space Complexity
0:17:53 Understanding Arrays
0:21:03 Working with Arrays
0:24:32 Exercise: Building an Array
0:27:24 Solution: Creating the Array Class
0:30:43 Solution: insert()
0:35:03 Solution: remove()
0:39:54 Solution: indexOf()
0:42:23 Dynamic Arrays
0:46:11 Linked Lists Introduction
0:46:41 What are Linked Lists?
0:51:16 Working with Linked Lists
0:54:40 Exercise: Building a Linked List
0:56:05 Solution: addLast()
1:02:15 Solution: addFirst()
1:04:28 Solution: indexOf()
1:06:23 Solution: contains()
1:07:28 Solution: removeFirst()
1:11:52 Solution: removeLast()

#ComputerScience #Coding #Programming

[robertstimmel]

I'm only about a half-hour into this lesson, and I can already tell that it will be very helpful. I was trying to follow along with an eight-hour video posted by a Google engineer and was really struggling. Your approach to teaching this concept is working much better for me. Thank you for posting this video!

[philly_zzz]

Just wanted to say how much I appreciate you as a teacher Mosh -- you communicate things so well and make math and computer science genuinely fun to learn

[chetanpatteparapu]

This is the most underrated course ever. Best resource to master data structure and algorithms...

[GeekyMan]

A huge thank you Mosh! You don't know how much I love to watch your videos. It's a strange matter in me that I am never satisfied by just good explanation, I also need to have nice presentations too! Just like the one you are having. Your videos are the just perfect blueprint of the kind of educational videos I always wanted to watch...once again, thanks mosh. You really get my back everytime I need to have such nice explanations of any topic!!❤️

[UnkownUnkown]

Huge thanks to you, I finally understand linked lists and how to work with them, before this I was struggling a lot with them. Now I understand them very well. You're amazing for giving us this for free.

[jaimerojas]

Thanks Mosh this is just what I needed to level up as a developer right now <3

[nipun]

Best way to get it started! I just love your tutorials Mosh . Hope you never stop posting your tutorials.

[evilmonk]

For Mobile Users

0:00:00 Intro
0:01:04 What is Big O?
0:03:03 O(1)
0:04:32 O(n)
0:08:17 O(n^2)
0:10:41 O(log n)
0:13:20 O(2^n)
0:14:10 Space Complexity
0:17:53 Understanding Arrays
0:21:03 Working with Arrays
0:24:32 Exercise: Building an Array
0:27:24 Solution: Creating the Array Class
0:30:43 Solution: insert()
0:35:03 Solution: remove()
0:39:54 Solution: indexOf()
0:42:23 Dynamic Arrays
0:46:11 Linked Lists Introduction
0:46:41 What are Linked Lists?
0:51:16 Working with Linked Lists
0:54:40 Exercise: Building a Linked List
0:56:05 Solution: addLast()
1:02:15 Solution: addFirst()
1:04:28 Solution: indexOf()
1:06:23 Solution: contains()
1:07:28 Solution: removeFirst()
1:11:52 Solution: removeLast()

[lumbardhsallauka]

Thank you Mosh !
Yo're so fluent in programming, very clear & easy to be understood, always positive and having fun while coding.

[alexandrosntousias]

Mosh, you're an amazing tutor! YouTube suggested me your design patterns lesson and from that moment I can't stop watching your videos. I'm also going to buy the whole courses from your website.
I would like to point out a correction (or rather an omission) on this video though. Although you correctly pointed out that the time complexity of removing the last item from a linked list is O(n), for the Java LinkedList is actually O(1) since it's implemented as a double linked-list.

Again, thank you for your awesome work!

[acuraintdohc]

Great video! For the removeAt() method for Array, I believe if you have an Array on length 1 and one element within it, passing 0 as the index will cause an array index out of bounds exception.

[vijaypanhale]

This tutorial from Mosh is really changed my mind to look towards Data Structures.A lot thanks and support to Mosh.Never find this kind of tutorial which is explained in more easy and detailed way. 🙌

[marwalucia]

for sure i had never saw such a teacher like you in this world you are beyond the time

[MCARBINE]

Awesome video! Thank you so much for making these videos. I'm going to purchase the full course.

[nasser_omar]

You aren't just an amazing man you are wonderful with the meaning of the word.

A lot of thanks to you. Every single word is useful than you imagine

[viktorhristov]

39:03 in the removeAt() method the for loop's condition should be i < count - 1, because inside it's block you access items[i + 1] which in case where count == items.length will throw an ArrayIndexOutOfBounds exception. I know that count can't be equal to the length of the array because you resize it when that happens, but It is still a small mistake since your method will be dependent of your insert method so I decided I should mention it. Overall the video is very well made and explains everything with simple examples.

[munapadhi]

Mosh is the one best computer science teacher in the world, i love your all the courses thanks for your hard working.

[ajayspatil]

Dear mosh, your courses are the best I’ve ever taken, I never thought that Data structures and algorithms would be this easy, all thanks to you Mosh!

[MandolinSashaank]

Finally. I was waiting so long for this. Thank you so much once again mosh 😀

[shafiqsoherwardy]

Sir mosh, you're way of teaching is best, I love to be as a your student.