Master Data Structures & Algorithms for Beginners | Ace Your Coding Interviews π
Learn essential data structures like arrays and linked lists, understand Big O notation, and prepare to excel in coding interviews with this comprehensive beginner tutorial.

Programming with Mosh
2.0M views β’ Dec 10, 2019

About this video
Data Structures and algorithms for beginners. Ace your coding interview. Watch this tutorial to learn all about Big O, arrays and linked lists!
π Get interview-ready with my full course: https://mosh.link/dsa-course
π Subscribe for more awesome content: https://goo.gl/6PYaGF
Need Java foundations first? Check out my tutorial: https://youtu.be/eIrMbAQSU34
β Stay connected:
- Twitter: https://twitter.com/moshhamedani
- Facebook: https://www.facebook.com/programmingwithmosh/
- Instagram: https://www.instagram.com/codewithmosh.official/
- LinkedIn: https://www.linkedin.com/school/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
π Get interview-ready with my full course: https://mosh.link/dsa-course
π Subscribe for more awesome content: https://goo.gl/6PYaGF
Need Java foundations first? Check out my tutorial: https://youtu.be/eIrMbAQSU34
β Stay connected:
- Twitter: https://twitter.com/moshhamedani
- Facebook: https://www.facebook.com/programmingwithmosh/
- Instagram: https://www.instagram.com/codewithmosh.official/
- LinkedIn: https://www.linkedin.com/school/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
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
2.0M
Likes
41.7K
Duration
01:18:43
Published
Dec 10, 2019
User Reviews
4.8
(406) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.