Java Data Structures & Algorithms: Ace Coding Interviews!
- Description
- Curriculum
- FAQ
- Reviews
Welcome to the Data Structures and Algorithms in Java Course!
Are you a Java programmer who wants to write efficient code and improve your programming and problem solving skills ?
Do you have an upcoming coding interview and you want to ace it with confidence ?
If the answer is yes, then this course is the right choice for you!
In this course you will learn everything about Data Structures and Algorithms and how to implement and use them in Java.
The concepts are explained with animations which makes it much more easier to understand and memorize.
You will also apply your knowledge throughout the course via coding exercises and Leetcode coding challenges with video solutions.
The course covers the following topics:
General
-
Why Should You Learn Data Structures and Algorithms ?
-
What are Data Structures ?
-
What are Algorithms ?
Big O Notation
-
Linear Complexity – O(n)
-
Constant Complexity – O(1)
-
Quadratic Complexity – O(n^2)
-
Logarithmic Complexity – O(logn)
-
Constants in Big O
-
Dominant and Non-Dominant Factors in Big O
-
Complexities Comparison
Data Structures
-
Linked Lists
-
Doubly Linked Lists
-
Stacks
-
Queues
-
Sets
-
Trees
-
Tries
-
Heaps
-
Hash Tables
-
Graphs
Algorithms
-
Linear Search
-
Binary Search
-
Bubble Sort
-
Insertion Sort
-
Selection Sort
-
Merge Sort
-
Recursion
-
Tree Traversal
-
Graph Traversal
I’m confident that you will enjoy this course, but if you for some reason are not happy with the course it’s backed by Udemy’s 30 day money back guarantee, so nothing to lose!
I’m excited to see you in the course, hit that enroll button and start your mastering Data Structures & Algorithms journey 🙂
-
4Introduction to Big O NotationVideo lesson
-
5Linear Complexity - O(n)Video lesson
-
6Constant Complexity - O(1)Video lesson
-
7Quadratic Complexity - O(n^2)Video lesson
-
8Logarithmic Complexity - O(logn)Video lesson
-
9Constants in Big OVideo lesson
-
10Dominant and Non-Dominant Factors in Big OVideo lesson
-
11Complexities ComparisonVideo lesson
-
14Introduction to Linked ListsVideo lesson
-
15Linked List Class ImplementationVideo lesson
-
16Linked List: Add ElementVideo lesson
-
17Linked List: Append ImplementationVideo lesson
-
18Linked List: Prepend ImplementationVideo lesson
-
19Linked List: IteratingVideo lesson
-
20Linked List: Iterating ImplementationVideo lesson
-
21Linked List: Removing ElementsVideo lesson
-
22Linked List: Removing Elements ImplementationVideo lesson
-
23Time Complexity of Linked Lists OperationsVideo lesson
-
24When to Use Linked ListsVideo lesson
-
51Introduction to TreesVideo lesson
-
52Binary TreesVideo lesson
-
53Complete Binary TreesVideo lesson
-
54Binary Search TreesVideo lesson
-
55Binary Search Trees: Insert OperationVideo lesson
-
56Binary Search Trees: Class ImplementationVideo lesson
-
57Binary Search Trees: Insert Operation ImplementationVideo lesson
-
58Binary Search Trees: Search Operation ImplementationVideo lesson
-
63Introduction to HeapsVideo lesson
-
64Heaps: InsertVideo lesson
-
65Heaps: PopVideo lesson
-
66Heap Implementation: Class and Helper FunctionsVideo lesson
-
67Heap Implementation: insert()Video lesson
-
68Heap Implementation: remove()Video lesson
-
69Heap Implementation: Heapify DownVideo lesson
-
70Heap Operations Time ComplexitiesVideo lesson