Learn essential data structures and algorithms in this comprehensive tutorial designed for beginners and aspiring software engineers. Dive into key concepts like Big O notation, arrays, and linked lists to enhance your problem-solving skills and prepare for coding interviews. Explore various time complexities, including O(1), O(n), O(n^2), O(log n), and O(2^n), as well as space complexity. Master array operations and implementations, and gain a thorough understanding of linked lists through practical exercises and solutions. By the end of this 1-hour 19-minute video, you'll have a solid foundation in fundamental data structures and algorithms, crucial for excelling in technical interviews and improving your programming abilities.
Overview
Syllabus
Intro.
What is Big O?.
O(1).
O(n).
O(n^2).
O(log n).
O(2^n).
Space Complexity.
Understanding Arrays.
Working with Arrays.
Exercise: Building an Array .
Solution: Creating the Array Class .
Solution: insert().
Solution: remove().
Solution: indexOf().
Dynamic Arrays.
Linked Lists Introduction.
What are Linked Lists?.
Working with Linked Lists .
Exercise: Building a Linked List .
Solution: addLast().
Solution: addFirst().
Solution: indexOf().
Solution: contains().
Solution: removeFirst().
Solution: removeLast().
Taught by
Programming with Mosh
Related Courses
-
Data Structures and Algorithms with Visualizations – Full Course (Java)
-
Data Structures - Computer Science Course for Beginners
-
Data Structures Easy to Advanced Course - Full Tutorial from a Google Engineer
-
The Last Algorithms Course You'll Need
-
Introduction to Data Structures Course (How To)
-
Introduction to Data Structures for Interviews
