Mô tả

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 you will get in this course…


Over 100 hand-crafted animated HD videos to illustrate the Data Structures & Algorithms.


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

  • Heaps

  • Graphs


Algorithms

Sorting

  • Bubble Sort

  • Selection Sort

  • Insertion Sort

  • Merge Sort

  • Quick Sort

Searching

  • Breadth First Search

  • Depth First Search



Don't just take my word for it though, check out what existing students have to say about my courses:

  • 5-Star Review:
    "In order to describe this course accurately, we need the definition of the word Beautiful. beau·ti·ful: adjective 1.- pleasing the senses or mind aesthetically. 2.- of a very high standard; excellent."  - Josue Hernandez Amezcua

  • 5-Star Review:
    "The best course on DSA on Udemy" - Enlai Li

  • 5-Star Review:
    "One of the best courses on DSA. The animations do make a huge impact. All the points are explained in detail. The only problem is that I can't give it more than a 5-star rating." - Nikita Sarkar

  • 5-Star Review:
    "Amazing Course. My words cannot describe how much animations helped me to understand the concepts. 100% Recommended." - Simarjeet Singh

  • 5-Star Review:
    Being a visual learner this is BY FAR the BEST course ever. The way the instructor presents this topic makes it so easy to understand." - Eduardo SN

  • 5-Star Review:
    "The animations were really helpful for an easy understanding, but the best thing about this course for me is that it will not waste your time! It is perfectly optimized, covers the important topics that I wanted, and at the same time perfectly clear. Thank you so much." - Fatemeh Moghaddam

  • 5-Star Review:
    "This course is very well done! ... the animations in each video take the explanation and understanding of the material to a new level." - Luis Felipe Posada

  • 5-Star Review:
    "This course has seriously been amazing. The animations have worked wonders for my understanding and I have made significant progress from the beginning of the course until now." - Dakota Fabro

  • 5-Star Review:
    "I can follow as a beginner, amazing." - Sabrina Fung

  • 5-Star Review:
    "This is the best course I have ever seen" - Luong Viet Tri

REMEMBER… I'm so confident that you'll love this course that we're offering a FULL money-back guarantee for 30 days! So it's a complete no-brainer, sign up today with ZERO risk and EVERYTHING to gain.

So what are you waiting for? Click the "Buy now" button and join the best Java Data Structures & Algorithms course on Udemy.

I look forward to seeing you in the course.

Now let's get started! :-)


Bạn sẽ học được gì

<> 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

Yêu cầu

  • Basic programming
  • No experience with data structures or algorithms required

Nội dung khoá học

41 sections

Introduction

3 lectures
Introduction
03:25
Overview (Please Watch)
06:16
Code Editor
09:21

Big O

13 lectures
Big O: Intro
02:55
Big O: Worst Case
01:36
Big O: O(n)
01:50
<> Big O: O(n)
1 question
Big O: Drop Constants
01:34
Big O: O(n^2)
02:00
Big O: Drop Non-Dominants
02:07
Big O: O(1)
01:47
Big O: O(log n)
03:43
Big O: Different Terms for Inputs
02:23
Big O: Array Lists
04:54
Big O: Wrap Up
07:02
Big O
5 questions

Classes & Pointers

2 lectures
Classes
06:41
Pointers
05:51

Linked Lists

17 lectures
Linked List: Intro
02:42
LL: Big O
06:00
LL: Under the Hood
02:18
LL: Constructor
09:17
Coding Exercises (Important)
00:05
LL: Print List
03:01
LL: Append
03:53
LL: Remove Last (Intro)
04:51
LL: Remove Last (Code)
09:31
LL: Prepend
03:43
LL: Remove First
06:27
LL: Get
04:21
LL: Set
04:30
LL: Insert
05:36
LL: Remove
07:15
LL: Reverse
05:49
Linked List Big O
3 questions

<> LL: Coding Exercises

10 lectures
LL: Constructor
1 question
LL: Append
1 question
LL: Remove Last
1 question
LL: Prepend
1 question
LL: Remove First
1 question
LL: Get
1 question
LL: Set
1 question
LL: Insert
1 question
LL: Remove
1 question
LL: Reverse
1 question

<> LL: Interview / LeetCode Exercises

8 lectures
Introduction to Interview Questions (DO NOT SKIP)
00:55
LL: Find Middle Node ( ** Interview Question)
1 question
LL: Has Loop ( ** Interview Question)
1 question
LL: Find Kth Node From End ( ** Interview Question)
1 question
LL: Partition List ( ** Interview Question)
1 question
LL: Remove Duplicates ( ** Interview Question)
1 question
LL: Binary to Decimal ( ** Interview Question)
1 question
LL: Reverse Between ( ** Interview Question)
1 question

Doubly Linked Lists

9 lectures
DLL: Constructor
03:56
DLL: Append
04:12
DLL: Remove Last
07:55
DLL: Prepend
03:55
DLL: Remove First
04:55
DLL: Get
06:33
DLL: Set
03:52
DLL: Insert
05:45
DLL: Remove
06:14

<> DLL: Coding Exercises

9 lectures
DLL: Constructor
1 question
DLL: Append
1 question
DLL: Remove Last
1 question
DLL: Prepend
1 question
DLL: Remove First
1 question
DLL: Get
1 question
DLL: Set
1 question
DLL: Insert
1 question
DLL: Remove
1 question

<> DLL: Interview / LeetCode Exercises

4 lectures
DLL: Swap First and Last ( ** Interview Question)
1 question
DLL: Reverse ( ** Interview Question)
1 question
DLL: Palindrome Checker ( ** Interview Question)
1 question
DLL: Swap Nodes in Pairs ( ** Interview Question)
1 question

Stacks & Queues

9 lectures
Stack: Intro
05:20
Stack: Constructor
03:46
Stack: Push
03:09
Stack: Pop
02:48
Queue: Intro
02:36
Queue: Constructor
04:30
Queue: Enqueue
03:29
Queue: Dequeue
04:17
Stacks & Queues Big O
3 questions

<> S&Q: Coding Exercises

6 lectures
Stack: Constructor
1 question
Stack: Push
1 question
Stack: Pop
1 question
Queue: Constructor
1 question
Queue: Enqueue
1 question
Queue: Dequeue
1 question

<> S&Q: Interview / LeetCode Exercises

7 lectures
Stack: Push for a Stack That Uses an ArrayList ( ** Interview Question)
1 question
Stack: Pop for a Stack That Uses an ArrayList ( ** Interview Question)
1 question
Stack: Reverse String ( ** Interview Question)
1 question
Stack: Parentheses Balanced ( ** Interview Question)
1 question
Stack: Sort Stack ( ** Interview Question)
1 question
Queue Using Stacks: Enqueue ( ** Interview Question)
1 question
Queue Using Stacks: Dequeue ( ** Interview Question)
1 question

Trees

9 lectures
Trees: Intro & Terminology
04:23
Binary Search Trees: Example
02:33
BST: Big O
08:01
BST: Constructor
05:54
BST: Insert - Intro
05:32
BST: Insert - Code
09:52
BST: Contains - Intro
03:14
BST: Contains - Code
07:16
BST Big O
3 questions

<> BST: Coding Exercises

3 lectures
BST: Constructor
1 question
BST: Insert
1 question
BST: Contains
1 question

<> BST: Interview / LeetCode Exercises

1 lectures
BST: Interview / LeetCode Exercises Location
00:50

Hash Tables

10 lectures
Hash Table: Intro
04:40
HT: Collisions
01:48
HT: Constructor
05:17
HT: Hash Method
04:13
HT: Set
05:41
HT: Get
06:08
HT: Keys
03:21
HT: Big O
02:14
HT: Interview Question
07:29
Hash Table Big O
3 questions

<> HT: Coding Exercises

4 lectures
HT: Constructor
1 question
HT: Set
1 question
HT: Get
1 question
HT: Keys
1 question

<> HT: Interview / LeetCode Exercises

11 lectures
HT: Item In Common ( ** Interview Question)
1 question
HT: Find Duplicates ( ** Interview Question)
1 question
HT: First Non-Repeating Character ( ** Interview Question)
1 question
HT: Group Anagrams ( ** Interview Question)
1 question
HT: Two Sum ( ** Interview Question)
1 question
HT: Subarray Sum ( ** Interview Question)
1 question
Introduction to Sets
01:15
Set: Remove Duplicates ( ** Interview Question)
1 question
Set: Has Unique Chars ( ** Interview Question)
1 question
Set: Find Pairs ( ** Interview Question)
1 question
Set: Longest Consecutive Sequence ( ** Interview Question)
1 question

Graphs

9 lectures
Graph: Intro
03:45
Graph: Adjacency Matrix
02:58
Graph: Adjacency List
01:25
Graph: Big O
07:09
Graph: Add Vertex
05:19
Graph: Add Edge
03:35
Graph: Remove Edge
03:37
Graph: Remove Vertex
06:58
Graph Big O
3 questions

<> Graph: Coding Exercises

4 lectures
Graph: Add Vertex
1 question
Graph: Add Edge
1 question
Graph: Remove Edge
1 question
Graph: Remove Vertex
1 question

Heaps

7 lectures
Heap: Intro
06:03
Heap: Insert (Intro)
04:40
Heap: Helper Methods
02:41
Heap: Insert (Code)
06:07
Heap: Remove
04:59
Heap: Sink Down
08:52
Heap: Priority Queues & Big O
04:30

<> Heap: Coding Exercises

6 lectures
Heap: Insert
1 question
Heap: Remove
1 question
Heap: Sink Down
1 question
Heap: MinHeap Insert
1 question
Heap: MinHeap Remove
1 question
Heap: MinHeap Sink Down
1 question

<> Heap: Interview / LeetCode Exercises

2 lectures
<> Heap: Kth Smallest Element in an Array
1 question
<> Heap: Maximum Element in a Stream
1 question

Recursion

3 lectures
Recursion: Intro
06:58
Call Stack
07:14
Factorial
09:19

Recursive Binary Search Trees

7 lectures
rBST: Contains
07:22
rBST: Insert
08:17
rBST: Delete Intro
02:20
rBST: Delete Code (1 of 3)
05:17
rBST: Delete Code (2 of 3)
04:49
rBST: Minimum Value
04:24
rBST: Delete Code (3 of 3)
05:22

<> rBST: Coding Exercises

4 lectures
rBST: Contains
1 question
rBST: Insert
1 question
BST: Minimum Value
1 question
rBST: Delete
1 question

<> rBST: Interview / LeetCode Exercises

2 lectures
BST: Convert Sorted Array to Balanced BST ( ** Interview Question)
1 question
BST: Invert Binary Tree ( ** Interview Question)
1 question

Tree Traversal

9 lectures
Tree Traversal: Intro
01:27
BFS (Breadth First Search): Intro
03:08
BFS: Code
06:14
DFS (Depth First Search): PreOrder - Intro
01:10
DFS: PreOrder - Code
07:00
DFS: PostOrder - Intro
02:13
DFS: PostOrder - Code
05:31
DFS: InOrder - Intro
01:59
DFS: InOrder - Code
05:16

<> BST Traversal: Coding Exercises

4 lectures
BST: Breadth First Search (BFS)
1 question
BST: DFS PreOrder
1 question
BST: DFS PostOrder
1 question
BST: DFS InOrder
1 question

<> BST Traversal: Interview / LeetCode Exercises

2 lectures
BST: Validate BST ( ** Interview Question)
1 question
BST: Kth Smallest Node ( ** Interview Question)
1 question

Basic Sorts

8 lectures
Bubble Sort: Intro
02:36
Bubble Sort: Code
05:37
Selection Sort: Intro
03:38
Selection Sort: Code
05:21
Insertion Sort: Intro
01:42
Insertion Sort: Code
04:38
Insertion Sort: Big O
01:20
Basic Sorts
3 questions

<> Basic Sorts: Coding Exercises

3 lectures
Bubble Sort
1 question
Selection Sort
1 question
Insertion Sort
1 question

<> Basic Sorts: Interview / LeetCode Exercises

3 lectures
Bubble Sort of LL ( ** Interview Question)
1 question
Selection Sort of LL ( ** Interview Question)
1 question
Insertion Sort of LL ( ** Interview Question)
1 question

Merge Sort

6 lectures
Merge Sort: Overview
01:36
Merge: Intro
01:35
Merge: Code
05:36
Merge Sort: Intro
01:58
Merge Sort: Code
11:39
Merge Sort: Big O
03:23

<> Merge Sort: Coding Exercises

2 lectures
Merge
1 question
Merge Sort
1 question

<> Merge: Interview / LeetCode Exercise

1 lectures
LL: Merge Two Sorted Lists ( ** Interview Question)
1 question

Quick Sort

5 lectures
Quick Sort: Intro
02:43
Pivot: Intro
03:30
Pivot: Code
05:34
Quick Sort: Code
06:12
Quick Sort: Big O
02:59

<> Quick Sort: Coding Exercises

2 lectures
Pivot
1 question
Quick Sort
1 question

Dynamic Programming

5 lectures
Overlapping Subproblems
04:52
Optimized Substructure
03:27
Fibonacci Sequence
09:57
Memoization
13:04
Bottom Up
07:09

<> Array: Interview / LeetCode Exercises

7 lectures
Array: Remove Element ( ** Interview Question)
1 question
Array: Find Max Min ( ** Interview Question)
1 question
Array: Find Longest String ( ** Interview Question)
1 question
Array: Remove Duplicates ( ** Interview Question)
1 question
Array: Max Profit ( ** Interview Question)
1 question
Array: Rotate ( ** Interview Question)
1 question
Array: Max Sub Array ( ** Interview Question)
1 question

Coding Exercises

2 lectures
Coding Exercises Are Now After Each Section - (CLICK HERE FOR MORE INFO)
00:09
Thank You!
00:08

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.