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

Get interviewready with my full course: https://mosh.link/dsacourse
Subscribe for more awesome content: https://goo.gl/6PYaGF

Need Java foundations first? Check out my tutorial:    • Java Tutorial for Beginners  

✋ Stay connected:
Twitter:   / moshhamedani  
Facebook:   / programmingwithmosh  
Instagram:   / codewithmosh.official  
LinkedIn:   / codewithmosh  

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