Java Data Structures & Algorithms + LEETCODE Exercises
About Course
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.
I have made several Free Sample Videos available for the course so you can see the difference the animations make.
Also, I am very active on the Q&A, so I will be with you every_step_of _the_way.
What Will You Learn?
- 100 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
- Strengthen Your Skills as a Developer
Course Content
Subtitle Guide – Hướng dẫn thêm phụ đề
01 – Introduction
-
-
03:25
-
06:16
-
09:21
02 – Big O
-
-
02:55
-
01:36
-
01:50
-
01:34
-
02:00
-
02:07
-
01:47
-
03:43
-
02:23
-
04:54
-
07:02
03 – Classes & Pointers
-
-
06:41
-
05:51
04 – Linked Lists
-
-
02:42
-
06:00
-
02:18
-
09:17
-
03:01
-
03:53
-
04:51
-
09:31
-
03:43
-
06:27
-
04:21
-
04:30
-
05:36
-
07:15
-
05:49
05 – LL Coding Exercises
06 – LL Interview LeetCode Exercises
07 – Doubly Linked Lists
-
-
03:56
-
04:12
-
07:55
-
03:55
-
04:55
-
06:33
-
03:52
-
05:45
-
06:14
08 – DLL Coding Exercises
09 – DLL Interview LeetCode Exercises
10 – Stacks & Queues
-
-
05:20
-
03:46
-
03:09
-
02:48
-
02:36
-
04:30
-
03:29
-
04:17
11 – S&Q Coding Exercises
12 – S&Q Interview LeetCode Exercises
13 – Trees
-
-
04:23
-
02:33
-
08:01
-
05:54
-
05:32
-
09:52
-
03:14
-
07:16
14 – BST Coding Exercises
15 – BST Interview LeetCode Exercises
16 – Hash Tables
-
-
04:40
-
01:48
-
05:17
-
04:13
-
05:41
-
06:08
-
03:21
-
02:14
-
07:29
17 – HT Coding Exercises
18 – HT Interview LeetCode Exercises
19 – Graphs
-
-
03:45
-
02:58
-
01:25
-
07:09
-
05:19
-
03:35
-
03:37
-
06:58
20 – Graph Coding Exercises
21 – Heaps
-
-
06:03
-
04:40
-
02:41
-
06:07
-
04:59
-
08:52
-
04:30
22 – Heap Coding Exercises
23 – Heap Interview LeetCode Exercises
24 – Recursion
-
-
06:58
-
07:14
-
09:19
25 – Recursive Binary Search Trees
-
-
07:22
-
08:17
-
02:20
-
05:17
-
04:49
-
04:24
-
05:22
26 – rBST Coding Exercises
27 – rBST Interview LeetCode Exercises
28 – Tree Traversal
-
-
01:27
-
03:08
-
06:14
-
01:10
-
07:00
-
02:13
-
05:31
-
01:59
-
05:16
29 – BST Traversal Coding Exercises
30 – BST Traversal Interview LeetCode Exercises
31 – Basic Sorts
-
-
02:36
-
05:37
-
03:38
-
05:21
-
01:42
-
04:38
-
01:20
32 – Basic Sorts Coding Exercises
33 – Basic Sorts Interview LeetCode Exercises
34 – Merge Sort
-
-
01:36
-
01:35
-
05:36
-
01:58
-
11:39
-
03:23
35 – Merge Sort Coding Exercises
36 – Merge Interview LeetCode Exercise
37 – Quick Sort
-
-
02:43
-
03:30
-
05:34
-
06:12
-
02:59
38 – Quick Sort Coding Exercises
39 – Dynamic Programming
-
-
04:52
-
03:27
-
09:57
-
13:04
-
07:09