English | MP4 | AVC 1280×720 | AAC 44KHz 2ch | 113 lectures (8h 27m) | 1.33 GB
DSA for the Cracking the Coding Interview. Animated Examples for Faster Learning and Deeper Understanding.
Welcome to Data Structures & Algorithms in Java
This course makes learning to code fun and makes hard concepts easy to understand.
How did I do this? By using animations!
Animating the Data Structures & Algorithms makes everything more visually engaging and allows students to learn more material – in less time – with higher retention (a pretty good combination).
I will use these visuals to guide you, step-by-step, through the entire course.
The course also includes dozens-and-dozens of Coding Exercises. So you can immediately put everything into practice as soon as you learn it (a very important step).
All of this will help you to feel more confident and prepared when you walk into a coding interview.
Here are the topics we will cover:
Technical
- Big O notation
Data Structures
- Arrays
- Array Lists
- Linked Lists
- Doubly Linked Lists
- Stacks & Queues
- Binary Trees
- Hash Tables
- Graphs
Algorithms
- Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Searching
- Breadth First Search
- Depth First Search
What you’ll learn
- 76 Coding Exercises with Detailed Explanations
- Learn DSA Faster with Animated Examples
- Mastery of Data Structures and Algorithms
- Confidently Answer Technical Interview Questions
- Time and Space Complexity of Data Structures and Algorithms
Table of Contents
Introduction
1 Introduction
2 Overview (Please Watch)
3 Code Editor
Big O
4 Big O Intro
5 Big O Worst Case
6 Big O O(n)
7 Big O Drop Constants
8 Big O O(n^2)
9 Big O Drop Non-Dominants
10 Big O O(1)
11 Big O O(log n)
12 Big O Different Terms for Inputs
13 Big O Array Lists
14 Big O Wrap Up
Classes & Pointers
15 Classes
16 Pointers
Linked Lists
17 Linked List Intro
18 LL Big O
19 LL Under the Hood
20 LL Constructor
21 Coding Exercises (Important)
22 LL Print List
23 LL Append
24 LL Remove Last (Intro)
25 LL Remove Last (Code)
26 LL Prepend
27 LL Remove First
28 LL Get
29 LL Set
30 LL Insert
31 LL Remove
32 LL Reverse
⚡ LL Coding Exercises
⚡ LL Interview Leetcode Exercises
Doubly Linked Lists
33 DLL Constructor
34 DLL Append
35 DLL Remove Last
36 DLL Prepend
37 DLL Remove First
38 DLL Get
39 DLL Set
40 DLL Insert
41 DLL Remove
⚡ DLL Coding Exercises
⚡ DLL Interview Leetcode Exercises
Stacks & Queues
42 Stack Intro
43 Stack Constructor
44 Stack Push
45 Stack Pop
46 Queue Intro
47 Queue Constructor
48 Queue Enqueue
49 Queue Dequeue
⚡ S&Q Coding Exercises
⚡ S&Q Interview Leetcode Exercises
Trees
50 Trees Intro & Terminology
51 Binary Search Trees Example
52 BST Big O
53 BST Constructor
54 BST Insert – Intro
55 BST Insert – Code
56 BST Contains – Intro
57 BST Contains – Code
⚡ BST Coding Exercises
Hash Tables
58 Hash Table Intro
59 HT Collisions
60 HT Constructor
61 HT Hash Method
62 HT Set
63 HT Get
64 HT Keys
65 HT Big O
66 HT Interview Question
⚡ HT Coding Exercises
⚡ HT Interview Leetcode Exercises
67 Introduction to Sets
Graphs
68 Graph Intro
69 Graph Adjacency Matrix
70 Graph Adjacency List
71 Graph Big O
72 Graph Add Vertex
73 Graph Add Edge
74 Graph Remove Edge
75 Graph Remove Vertex
⚡ Graph Coding Exercises
Recursion
76 Recursion Intro
77 Call Stack
78 Factorial
Recursive Binary Search Trees
79 rBST Contains
80 rBST Insert
81 rBST Delete Intro
82 rBST Delete Code (1 of 3)
83 rBST Delete Code (2 of 3)
84 rBST Minimum Value
85 rBST Delete Code (3 of 3)
Basic Sorts
86 Bubble Sort Intro
87 Bubble Sort Code
88 Selection Sort Intro
89 Selection Sort Code
90 Insertion Sort Intro
91 Insertion Sort Code
92 Insertion Sort Big O
⚡ Basic Sorts Coding Exercises
⚡ Basic Sorts Interview Leetcode Exercise
Merge Sort
93 Merge Sort Overview
94 Merge Intro
95 Merge Code
96 Merge Sort Intro
97 Merge Sort Code
98 Merge Sort Big O
⚡ Merge Sort Coding Exercises
⚡ Merge Interview Leetcode Exercise
Quick Sort
99 Quick Sort Intro
100 Pivot Intro
101 Pivot Code
102 Quick Sort Code
103 Quick Sort Big O
⚡ Quick Sort Coding Exercises
Tree Traversal
104 Tree Traversal Intro
105 BFS (Breadth First Search) Intro
106 BFS Code
107 DFS (Depth First Search) PreOrder – Intro
108 DFS PreOrder – Code
109 DFS PostOrder – Intro
110 DFS PostOrder – Code
111 DFS InOrder – Intro
112 DFS InOrder – Code
⚡ BST Traversal Coding Exercises
Coding Exercises
113 CODING EXERCISES HAVE MOVED!
Resolve the captcha to access the links!