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
01. Introduction
02. Big O
- 02:56
- 01:36
- 01:50
- 01:34
- 02:00
- 02:08
- 01:47
- 03:44
- 02:23
- 04:54
- 07:02
03. Classes & Pointers
- 06:41
- 05:51
04. Linked Lists
- 02:42
- 06:00
- 02:18
- 09:18
- 03:01
- 03:53
- 04:51
- 09:32
- 03:43
- 06:27
- 04:21
- 04:30
- 05:36
- 07:16
- 05:49
06. LL Interview LeetCode Exercises
07. Doubly Linked Lists
- 03:56
- 04:12
- 07:55
- 03:56
- 04:55
- 06:33
- 03:52
- 05:45
- 06:14
10. Stacks & Queues
- 05:20
- 03:47
- 03:09
- 02:48
- 02:36
- 04:30
- 03:29
- 04:17
13. Trees
- 04:23
- 02:33
- 08:02
- 05:54
- 05:32
- 09:52
- 03:14
- 07:16
15. BST Interview LeetCode Exercises
16. Hash Tables
- 04:40
- 01:48
- 05:18
- 04:13
- 05:41
- 06:09
- 03:22
- 02:14
- 07:29
18. HT Interview LeetCode Exercises
19. Graphs
21. Heaps
24. Recursion
25. Recursive Binary Search Trees
28. Tree Traversal
- 01:27
- 03:08
- 06:15
- 01:10
- 07:00
- 02:13
- 05:31
- 01:59
- 05:16
