Course Overview
Welcome to the Java Data Structures and Algorithms Masterclass, the most modern, and the most complete Data Structures and Algorithms in Java course on the internet.
At 45+ hours, this is the most comprehensive course online to help you ace your coding interviews and learn about Data Structures and Algorithms in Java. You will see 100+ Interview Questions done at the top technology companies such as Apple,Amazon, Google and Microsoft and how to face Interviews with comprehensive visual explanatory video materials which will bring you closer towards landing the tech job of your dreams!
Learning Java is one of the fastest ways to improve your career prospects as it is one of the most in demand tech skills! This course will help you in better understanding every detail of Data Structures and how algorithms are implemented in high level programming language.
We'll take you step-by-step through engaging video tutorials and teach you everything you need to succeed as a professional programmer.
After finishing this course, you will be able to:
Learn basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.
Learn the strengths and weaknesses of a variety of data structures, so you can choose the best data structure for your data and applications
Learn many of the algorithms commonly used to sort data, so your applications will perform efficiently when sorting large datasets
Learn how to apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.
Why this course is so special and different from any other resource available online?
This course will take you from very beginning to a very complex and advanced topics in understanding Data Structures and Algorithms!
You will get video lectures explaining concepts clearly with comprehensive visual explanations throughout the course.
You will also see Interview Questions done at the top technology companies such as Apple,Amazon, Google and Microsoft.
I cover everything you need to know about technical interview process!
So whether you are interested in learning the top programming language in the world in-depth and interested in learning the fundamental Algorithms, Data Structures and performance analysis that make up the core foundational skillset of every accomplished programmer/designer or software architect and is excited to ace your next technical interview this is the course for you!
And this is what you get by signing up today:
Lifetime access to 44+ hours of HD quality videos. No monthly subscription. Learn at your own pace, whenever you want
Friendly and fast support in the course Q&A whenever you have questions or get stuck
FULL money back guarantee for 30 days!
This course is designed to help you to achieve your career goals. Whether you are looking to get more into Data Structures and Algorithms , increase your earning potential or just want a job with more freedom, this is the right course for you!
The topics that are covered in this course.
Section 1 - Introduction
What are Data Structures?
What is an algorithm?
Why are Data Structures and Algorithms important?
Types of Data Structures
Types of Algorithms
Section 2 - Recursion
What is Recursion?
Why do we need recursion?
How Recursion works?
Recursive vs Iterative Solutions
When to use/avoid Recursion?
How to write Recursion in 3 steps?
How to find Fibonacci numbers using Recursion?
Section 3 - Cracking Recursion Interview Questions
Question 1 - Sum of Digits
Question 2 - Power
Question 3 - Greatest Common Divisor
Question 4 - Decimal To Binary
Section 4 - Bonus CHALLENGING Recursion Problems (Exercises)
power
factorial
productofArray
recursiveRange
fib
reverse
isPalindrome
someRecursive
flatten
captalizeFirst
nestedEvenSum
capitalizeWords
stringifyNumbers
collectStrings
Section 5 - Big O Notation
Analogy and Time Complexity
Big O, Big Theta and Big Omega
Time complexity examples
Space Complexity
Drop the Constants and the non dominant terms
Add vs Multiply
How to measure the codes using Big O?
How to find time complexity for Recursive calls?
How to measure Recursive Algorithms that make multiple calls?
Section 6 - Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)
Product and Sum
Print Pairs
Print Unordered Pairs
Print Unordered Pairs 2 Arrays
Print Unordered Pairs 2 Arrays 100000 Units
Reverse
O(N) Equivalents
Factorial Complexity
Fibonacci Complexity
Powers of 2
Section 7 - Arrays
What is an Array?
Types of Array
Arrays in Memory
Create an Array
Insertion Operation
Traversal Operation
Accessing an element of Array
Searching for an element in Array
Deleting an element from Array
Time and Space complexity of One Dimensional Array
One Dimensional Array Practice
Create Two Dimensional Array
Insertion - Two Dimensional Array
Accessing an element of Two Dimensional Array
Traversal - Two Dimensional Array
Searching for an element in Two Dimensional Array
Deletion - Two Dimensional Array
Time and Space complexity of Two Dimensional Array
When to use/avoid array
Section 8 - Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)
Question 1 - Missing Number
Question 2 - Pairs
Question 3 - Finding a number in an Array
Question 4 - Max product of two int
Question 5 - Is Unique
Question 6 - Permutation
Question 7 - Rotate Matrix
Section 9 - CHALLENGING Array Problems (Exercises)
Middle Function
2D Lists
Best Score
Missing Number
Duplicate Number
Pairs
Section 10 - Linked List
What is a Linked List?
Linked List vs Arrays
Types of Linked List
Linked List in the Memory
Creation of Singly Linked List
Insertion in Singly Linked List in Memory
Insertion in Singly Linked List Algorithm
Insertion Method in Singly Linked List
Traversal of Singly Linked List
Search for a value in Single Linked List
Deletion of node from Singly Linked List
Deletion Method in Singly Linked List
Deletion of entire Singly Linked List
Time and Space Complexity of Singly Linked List
Section 11 - Circular Singly Linked List
Creation of Circular Singly Linked List
Insertion in Circular Singly Linked List
Insertion Algorithm in Circular Singly Linked List
Insertion method in Circular Singly Linked List
Traversal of Circular Singly Linked List
Searching a node in Circular Singly Linked List
Deletion of a node from Circular Singly Linked List
Deletion Algorithm in Circular Singly Linked List
Method in Circular Singly Linked List
Deletion of entire Circular Singly Linked List
Time and Space Complexity of Circular Singly Linked List
Section 12 - Doubly Linked List
Creation of Doubly Linked List
Insertion in Doubly Linked List
Insertion Algorithm in Doubly Linked List
Insertion Method in Doubly Linked List
Traversal of Doubly Linked List
Reverse Traversal of Doubly Linked List
Searching for a node in Doubly Linked List
Deletion of a node in Doubly Linked List
Deletion Algorithm in Doubly Linked List
Deletion Method in Doubly Linked List
Deletion of entire Doubly Linked List
Time and Space Complexity of Doubly Linked List
Section 13 - Circular Doubly Linked List
Creation of Circular Doubly Linked List
Insertion in Circular Doubly Linked List
Insertion Algorithm in Circular Doubly Linked List
Insertion Method in Circular Doubly Linked List
Traversal of Circular Doubly Linked List
Reverse Traversal of Circular Doubly Linked List
Search for a node in Circular Doubly Linked List
Delete a node from Circular Doubly Linked List
Deletion Algorithm in Circular Doubly Linked List
Deletion Method in Circular Doubly Linked List
Entire Circular Doubly Linked List
Time and Space Complexity of Circular Doubly Linked List
Time Complexity of Linked List vs Arrays
Section 14 - Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)
Linked List Class
Question 1 - Remove Dups
Question 2 - Return Kth to Last
Question 3 - Partition
Question 4 - Sum Linked Lists
Question 5 - Intersection
Section 15 - Stack
What is a Stack?
What and Why of Stack?
Stack Operations
Stack using Array vs Linked List
Stack Operations using Array (Create, isEmpty, isFull)
Stack Operations using Array (Push, Pop, Peek, Delete)
Time and Space Complexity of Stack using Array
Stack Operations using Linked List
Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List
Time and Space Complexity of Stack using Linked List
When to Use/Avoid Stack
Stack Quiz
Section 16 - Queue
What is a Queue?
Linear Queue Operations using Array
Create, isFull, isEmpty and enQueue methods using Linear Queue Array
Dequeue, Peek and Delete Methods using Linear Queue Array
Time and Space Complexity of Linear Queue using Array
Why Circular Queue?
Circular Queue Operations using Array
Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array
Dequeue, Peek and Delete Methods in Circular Queue using Array
Time and Space Complexity of Circular Queue using Array
Queue Operations using Linked List
Create, Enqueue and isEmpty Methods in Queue using Linked List
Dequeue, Peek and Delete Methods in Queue using Linked List
Time and Space Complexity of Queue using Linked List
Array vs Linked List Implementation
When to Use/Avoid Queue?
Section 17 - Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)
Question 1 - Three in One
Question 2 - Stack Minimum
Question 3 - Stack of Plates
Question 4 - Queue via Stacks
Question 5 - Animal Shelter
Section 18 - Tree / Binary Tree
What is a Tree?
Why Tree?
Tree Terminology
How to create a basic tree in Java?
Binary Tree
Types of Binary Tree
Binary Tree Representation
Create Binary Tree (Linked List)
PreOrder Traversal Binary Tree (Linked List)
InOrder Traversal Binary Tree (Linked List)
PostOrder Traversal Binary Tree (Linked List)
LevelOrder Traversal Binary Tree (Linked List)
Searching for a node in Binary Tree (Linked List)
Inserting a node in Binary Tree (Linked List)
Delete a node from Binary Tree (Linked List)
Delete entire Binary Tree (Linked List)
Create Binary Tree (Array)
Insert a value Binary Tree (Array)
Search for a node in Binary Tree (Array)
PreOrder Traversal Binary Tree (Array)
InOrder Traversal Binary Tree (Array)
PostOrder Traversal Binary Tree (Array)
Level Order Traversal Binary Tree (Array)
Delete a node from Binary Tree (Array)
Entire Binary Tree (Array)
Linked List vs Python List Binary Tree
Section 19 - Binary Search Tree
What is a Binary Search Tree? Why do we need it?
Create a Binary Search Tree
Insert a node to BST
Traverse BST
Search in BST
Delete a node from BST
Delete entire BST
Time and Space complexity of BST
Section 20 - AVL Tree
What is an AVL Tree?
Why AVL Tree?
Common Operations on AVL Trees
Insert a node in AVL (Left Left Condition)
Insert a node in AVL (Left Right Condition)
Insert a node in AVL (Right Right Condition)
Insert a node in AVL (Right Left Condition)
Insert a node in AVL (all together)
Insert a node in AVL (method)
Delete a node from AVL (LL, LR, RR, RL)
Delete a node from AVL (all together)
Delete a node from AVL (method)
Delete entire AVL
Time and Space complexity of AVL Tree
Section 21 - Binary Heap
What is Binary Heap? Why do we need it?
Common operations (Creation, Peek, sizeofheap) on Binary Heap
Insert a node in Binary Heap
Extract a node from Binary Heap
Delete entire Binary Heap
Time and space complexity of Binary Heap
Section 22 - Trie
What is a Trie? Why do we need it?
Common Operations on Trie (Creation)
Insert a string in Trie
Search for a string in Trie
Delete a string from Trie
Practical use of Trie
Section 23 - Hashing
What is Hashing? Why do we need it?
Hashing Terminology
Hash Functions
Types of Collision Resolution Techniques
Hash Table is Full
Pros and Cons of Resolution Techniques
Practical Use of Hashing
Hashing vs Other Data structures
Section 24 - Sort Algorithms
What is Sorting?
Types of Sorting
Sorting Terminologies
Bubble Sort
Selection Sort
Insertion Sort
Bucket Sort
Merge Sort
Quick Sort
Heap Sort
Comparison of Sorting Algorithms
Section 25 - Searching Algorithms
Introduction to Searching Algorithms
Linear Search
Linear Search in Python
Binary Search
Binary Search in Python
Time Complexity of Binary Search
Section 26 - Graph Algorithms
What is a Graph? Why Graph?
Graph Terminology
Types of Graph
Graph Representation
Graph in Java using Adjacency Matrix
Graph in Java using Adjacency List
Section 27 - Graph Traversal
Breadth First Search Algorithm (BFS)
Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix
Breadth First Search Algorithm (BFS) in Java - Adjacency List
Time Complexity of Breadth First Search (BFS) Algorithm
Depth First Search (DFS) Algorithm
Depth First Search (DFS) Algorithm in Java - Adjacency List
Depth First Search (DFS) Algorithm in Java - Adjacency Matrix
Time Complexity of Depth First Search (DFS) Algorithm
BFS Traversal vs DFS Traversal
Section 28 - Topological Sort
What is Topological Sort?
Topological Sort Algorithm
Topological Sort using Adjacency List
Topological Sort using Adjacency Matrix
Time and Space Complexity of Topological Sort
Section 29 - Single Source Shortest Path Problem
SWhat is Single Source Shortest Path Problem?
Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP)
BFS for SSSPP in Java using Adjacency List
BFS for SSSPP in Java using Adjacency Matrix
Time and Space Complexity of BFS for SSSPP
Why does BFS not work with Weighted Graph?
Why does DFS not work for SSSP?
Section 30 - Dijkstra's Algorithm
Dijkstra's Algorithm for SSSPP
Dijkstra's Algorithm in Java - 1
Dijkstra's Algorithm in Java - 2
Dijkstra's Algorithm with Negative Cycle
Section 31 - Bellman Ford Algorithm
Bellman Ford Algorithm
Bellman Ford Algorithm with negative cycle
Why does Bellman Ford run V-1 times?
Bellman Ford in Python
BFS vs Dijkstra vs Bellman Ford
Section 32 - All Pairs Shortest Path Problem
All pairs shortest path problem
Dry run for All pair shortest path
Section 33 - Floyd Warshall
Floyd Warshall Algorithm
Why Floyd Warshall?
Floyd Warshall with negative cycle,
Floyd Warshall in Java,
BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall,
Section 34 - Minimum Spanning Tree
Minimum Spanning Tree,
Disjoint Set,
Disjoint Set in Java,
Section 35 - Kruskal's and Prim's Algorithms
Kruskal Algorithm,
Kruskal Algorithm in Python,
Prim's Algorithm,
Prim's Algorithm in Python,
Prim's vs Kruskal
Section 36 - Cracking Graph and Tree Interview Questions (Amazon,Facebook, Apple, Microsoft)
Section 37 - Greedy Algorithms
What is Greedy Algorithm?
Well known Greedy Algorithms
Activity Selection Problem
Activity Selection Problem in Python
Coin Change Problem
Coin Change Problem in Python
Fractional Knapsack Problem
Fractional Knapsack Problem in Python
Section 38 - Divide and Conquer Algorithms
What is a Divide and Conquer Algorithm?
Common Divide and Conquer algorithms
How to solve Fibonacci series using Divide and Conquer approach?
Number Factor
Number Factor in Java
House Robber
House Robber Problem in Java
Convert one string to another
Convert One String to another in Java
Zero One Knapsack problem
Zero One Knapsack problem in Java
Longest Common Sequence Problem
Longest Common Subsequence in Java
Longest Palindromic Subsequence Problem
Longest Palindromic Subsequence in Java
Minimum cost to reach the Last cell problem
Minimum Cost to reach the Last Cell in 2D array using Java
Number of Ways to reach the Last Cell with given Cost
Number of Ways to reach the Last Cell with given Cost in Java
Section 39 - Dynamic Programming
What is Dynamic Programming? (Overlapping property)
Where does the name of DC come from?
Top Down with Memoization
Bottom Up with Tabulation
Top Down vs Bottom Up
Is Merge Sort Dynamic Programming?
Number Factor Problem using Dynamic Programming
Number Factor : Top Down and Bottom Up
House Robber Problem using Dynamic Programming
House Robber : Top Down and Bottom Up
Convert one string to another using Dynamic Programming
Convert String using Bottom Up
Zero One Knapsack using Dynamic Programming
Zero One Knapsack - Top Down
Zero One Knapsack - Bottom Up
Section 40 - CHALLENGING Dynamic Programming Problems
Longest repeated Subsequence Length problem
Longest Common Subsequence Length problem
Longest Common Subsequence problem
Diff Utility
Shortest Common Subsequence problem
Length of Longest Palindromic Subsequence
Subset Sum Problem
Egg Dropping Puzzle
Maximum Length Chain of Pairs
Section 41 - A Recipe for Problem Solving
Introduction
Step 1 - Understand the problem
Step 2 - Examples
Step 3 - Break it Down
Step 4 - Solve or Simplify
Step 5 - Look Back and Refactor
Section 41 - Wild West
FAQ
FAQ area empty
Course curriculum
Chương 1 Introduction 9 bài · 31 phút
- Curriculum Walkthrough Học thử 8:21
- Getting the Most Out of This Course Học thử 4:27
- What is a data structure? Học thử 3:26
- What is an algorithm? Học thử 3:53
-
Why are Data Structures and Algorithms important? 3:40
- Types of Data Structures Học thử 3:22
-
Types of Algorithms 4:00
-
Lecture Notes
- Motivation Học thử
Chương 2 Big O Notation 12 bài · 49 phút
- What is Big O? Học thử 5:41
-
Big O Notations - (Big O, Big Omega, Big Theta) 4:51
-
Big O - O(1) 3:03
-
Big O - O(N) 3:00
-
Drop Constants 4:26
-
Big O - O(N^2) 4:26
-
Drop Non Dominant Terms 2:35
-
Big O - O(logN) 5:37
-
Add vs Multiply 3:18
-
Space Complexity 8:20
-
How to Measure the Code using Big O? 3:17
-
Big O Quiz
Chương 3 Arrays 19 bài · 2 giờ 8 phút
-
What is an Array? 7:57
-
Types of Arrays 6:51
-
Arrays in Memory 3:52
-
Create an Array 9:05
-
Insertion in Array 11:35
-
Accessing Elements in Array 5:12
-
Array Traversal 7:27
-
Search for Array Element 7:52
-
Delete Array Element 5:57
-
Time and Space Complexity of 1D Arrays 4:20
-
Create Two Dimensional Array 11:05
-
Insertion - Two Dimensional Array 10:38
-
Accessing Two Dimensional Array Element 7:16
-
Traverse Two Dimensional Array 7:21
-
Searching Two Dimensional Array 8:14
-
Delete Two Dimensional Array Element 6:36
-
Time and Space Complexity of 2D Arrays 4:06
-
When to Use/Avoid Arrays 2:37
-
Download Resources
Chương 4 PROJECT 1 - Arrays 4 bài · 17 phút
-
Goals - what you will make by the end of this section 2:51
-
Calculate Average Temperature 7:07
-
Find the Days Above Average Temperature 6:43
-
Download Resources
Chương 5 Array - CODING EXERCISES - LeetCode - Cracking FAANG Interview Questions 27 bài · 37 phút
-
Middle Function
-
Solution to Middle Function
-
2D Arrays
-
Solution to 2D Arrays
-
Best Score
-
Solution to Best Score
-
Missing Number
-
Solution to Missing Number
-
Duplicate Number
-
Solution to Duplicate Number
-
Remove Duplicates from Sorted Array - LeetCode 26
-
Solution to Remove Duplicates from Sorted Array - LeetCode 26
-
Best Time to Buy and Sell Stock - LeetCode 121
-
Solution to Best Time to Buy and Sell Stock - LeetCode 121
-
Two Sum - LeetCode 1
-
Solution to Two Sum - LeetCode 1
-
Finding a Number in an Array
-
Solution - Finding a Number in an Array 5:26
-
Max Product of Two Integers
-
Solution - Max Product of Two Integers 6:05
-
IsUnique / Contains Duplicate - LeetCode 217
-
Solution - IsUnique / Contains Duplicate - LeetCode 217 5:15
-
Permutation
-
Solution - Permutation 8:34
-
Rotate Matrix
-
Rotate Matrix / Image - LeetCode 48 11:16
-
Download Resources
Chương 6 ArrayList 9 bài · 46 phút
-
What is ArrayList? 3:31
-
ArrayList in Memory 4:44
-
Creating ArrayList 5:36
-
Insertion in ArrayList 9:41
-
Accessing Elements in ArrayList 2:34
-
Traversal of ArrayList 6:15
-
Search for an Element in ArrayList 5:40
-
Delete an Element for ArrayList 5:09
-
Time and Space Complexity of ArrayList 2:47
Chương 7 Cracking Big O Interview Questions - Arrays 7 bài · 29 phút
-
Question 1 - Time Complexity of Method that returns Sum and Product of Array 5:46
-
Question 2 - Time Complexity of Print Pairs Method 5:50
-
Question 3 - Time Complexity of Print Unordered Pairs Method 4:31
-
Question 4 - Find Time Complexity for Given Method 2:14
-
Question 5 - Find Time Complexity for Given Method 1:35
-
Question 6 - Time Complexity of Reverse Array Function 6:04
-
Question 7 - Equivalent to O(N) 3:23
Chương 8 Linked List 15 bài · 1 giờ 55 phút
-
What is a Linked List? 5:57
-
Linked List vs Array 3:49
-
Types of Linked List 10:53
-
Linked List in the Memory 4:00
-
Creation of Singly Linked List 9:53
-
Insertion in Singly Linked List in Memory 3:53
-
Insertion Algorithm in Singly Linked List 8:02
-
Insertion Method in Singly Linked List 14:55
-
Traversal of Singly Linked List 9:48
-
Searching in Singly Linked List 8:49
-
Deletion of a Node from Singly Linked List 9:37
-
Deletion Method in Singly Linked List 15:38
-
Deletion of Entire Singly Linked List 5:56
-
Time and Space Complexity of Singly Linked List 4:05
-
Download Resources
Chương 9 Linked List Coding Exercises 14 bài
-
Singly Linked List - Push
-
Solution to Singly Linked List - Push
-
Singly Linked List - Pop
-
Solution to Singly Linked List - Pop
-
Singly Linked List - Insert
-
Solution to Singly Linked List - Insert
-
Singly Linked List - Get
-
Solution to Singly Linked List - Get
-
Singly Linked List - Rotate
-
Solution to Singly Linked List - Rotate
-
Singly Linked List - Set
-
Solution to Singly Linked List - Set
-
Singly Linked List - Remove
-
Solution to Singly Linked List - Remove
Chương 10 Circular Singly Linked List 12 bài · 1 giờ 34 phút
-
Create Circular Singly Linked List 12:58
-
Insertion in Circular Singly Linked List 7:30
-
Insertion Algorithm in Circular Singly Linked List 4:48
-
Insertion Method Circular Singly Linked List 11:59
-
Traversal of Circular Singly Linked List 9:57
-
Searching a Node in Circular Singly Linked List 9:48
-
Deletion of a Node from Circular Singly List 8:38
-
Deletion Algorithm in Circular Singly Linked List 5:19
-
Deletion Method in Circular Singly Linked List 11:20
-
Delete Entire Circular Singly Linked List 6:31
-
Time and Space Complexity of Circular Singly Linked List 5:32
-
Download Resources
Chương 11 Circular Singly Linked List CODING EXERCISES 6 bài
-
Implement a Circular Singly Linked List
-
Solution - Implement a Circular Singly Linked List
-
Delete a Node from a Circular Singly Linked List
-
Solution - Delete a Node from a Circular Singly Linked List
-
Count the Number of Nodes
-
Solution to Count the Number of Nodes
Chương 12 Doubly Linked List 13 bài · 1 giờ 52 phút
-
Create Doubly Linked List 13:45
-
Insertion Doubly Linked List 9:54
-
Insertion Algorithm Doubly Linked List 6:29
-
Insertion Method Doubly Linked List 14:54
-
Traversal of Doubly Linked List 8:34
-
Reverse Traversal of Doubly Linked List 8:21
-
Searching for a Node in Doubly Linked List 8:55
-
Deletion of a Node in Doubly Linked List 8:33
-
Deletion Algorithm Doubly Linked List 6:08
-
Deletion Method in Doubly Linked List 13:44
-
Delete Entire Doubly Linked List 7:24
-
Time and Space Complexity of Doubly Linked List 5:27
-
Download Resources
Chương 13 Circular Doubly Linked List 14 bài · 1 giờ 58 phút
-
Create Doubly Linked List 12:21
-
Insertion Circular Doubly Linked List 10:29
-
Insertion Algorithm Circular Doubly Linked List 6:58
-
Insertion Method Circular Doubly Linked List 13:54
-
Traversal of Circular Doubly Linked List 8:31
-
Reverse Traversal of Circular Doubly Linked List 8:17
-
Search for a Node in Circular Doubly Linked List 8:59
-
Deletion in Circular Doubly Linked List 10:52
-
Deletion Algorithm in Circular Doubly Linked List 6:47
-
Deletion Method in Circular Doubly Linked List 11:51
-
Delete Entire Circular Doubly Linked List 7:40
-
Time and Space Complexity of Circular Doubly Linked List 4:33
-
Time Complexity of Array vs Linked List 7:12
-
Download Resources
Chương 14 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft) 12 bài · 1 giờ 4 phút
-
Linked List Class 10:18
-
Remove Dups
-
Solution - Remove Dups 10:51
-
Return Nth to Last
-
Solution - Return Nth to Last 9:19
-
Partition
-
Solution - Partition 9:36
-
Sum Lists
-
Solution - Sum Lists 10:51
-
Intersection
-
Solution - Intersection 13:20
-
Download Resources
Chương 15 Stack 12 bài · 1 giờ 8 phút
-
What and Why of Stack? 5:27
-
Stack Operations 6:32
-
Stack using Array vs Linked List 1:32
-
Stack Operations using Array (Create, isEmpty, isFull) 8:22
-
Stack Operations using Array (Push, Pop, Peek, Delete) 12:40
-
Time and Space Complexity of Stack using Array 2:47
-
Stack Operations using Linked List 6:46
-
Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List 18:10
-
Time and Space Complexity of Stack using Linked List 3:21
-
When to Use/Avoid Stack 2:14
-
Download Resources
-
Stack Quiz
Chương 16 Stack Coding Exercises 8 bài
-
Implement Stack
-
Solution and Explanation - Implement Stack Class
-
Push Method
-
Solution and Explanation - Push Method
-
Pop Method
-
Solution/Explanation and Time/Space Complexity - Pop Method
-
Balanced Parentheses Checker
-
Solution/Explanation and Time/Space Complexity of Balanced Parentheses Checker
Chương 17 Queue 17 bài · 2 giờ 7 phút
-
What is a Queue? 6:31
-
Linear Queue Operations using Array 7:09
-
Create, isFull, isEmpty and enQueue methods using Linear Queue Array 14:44
-
Dequeue, Peek and Delete Methods using Linear Queue Array 10:45
-
Time and Space Complexity of Linear Queue using Array 3:48
-
Why Circular Queue? 4:36
-
Circular Queue Operations using Array 7:59
-
Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array 18:19
-
Dequeue, Peek and Delete Methods in Circular Queue using Array 12:21
-
Time and Space Complexity of Circular Queue using Array 3:55
-
Queue Operations using Linked List 7:53
-
Create, Enqueue and isEmpty Methods in Queue using Linked List 10:44
-
Dequeue, Peek and Delete Methods in Queue using Linked List 10:27
-
Time and Space Complexity of Queue using Linked List 3:03
-
Array vs Linked List Implementation 2:27
-
When to Use/Avoid Queue? 1:56
-
Download Resources
Chương 18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft) 14 bài · 1 giờ 48 phút
-
Goals 1:03
-
Three in One
-
Solution - Three in One 23:48
-
Stack Minimum
-
Solution - Stack Minimum 12:47
-
Stack of Plates
-
Solution Part 1 - Stack of Plates 14:28
-
Solution Part 2 - Stack of Plates 10:56
-
Solution Part 3 - Follow UP 8:09
-
Queue via Stacks
-
Solution - Queue via Stacks 11:49
-
Animal Shelter
-
Solution - Animal Shelter 24:48
-
Download Resources
Chương 19 Recursion 11 bài · 1 giờ 4 phút
-
Goals : what you will learn by the end of this section 1:05
-
What is Recursion? 5:00
-
Why do we need Recursion? 3:21
-
The Logic Behind Recursion 9:15
-
Recursive vs Iterative Solution 4:13
-
When to Use/Avoid Recursion? 6:21
-
How to Write Recursion in 3 Steps? 13:42
-
Fibonacci Series using Recursion 9:37
-
How to Measure Recursive Algorithm? 7:19
-
How to Measure Recursive Algorithm with Multiple Calls? 4:06
-
Download the Resources
Chương 20 Cracking Recursion Interview Questions 5 bài · 30 phút
-
Question 1 - Sum of Digits 8:50
-
Question 2 - Power 5:55
-
Question 3 - GCD 6:40
-
Question 4 - Decimal to Binary 8:16
-
Download the Resources
Chương 21 Bonus CHALLENGING Recursion Problems 13 bài
-
Important Note!
-
Power
-
Factorial
-
Product of Array
-
RecursiveRange
-
Fib
-
SOLUTIONS PART 1
-
Reverse
-
IsPalindrome
-
SomeRecursive
-
First Uppercase
-
CapitalizeWord
-
SOLUTIONS PART 2
Chương 22 Tree / Binary Tree 27 bài · 3 giờ 11 phút
-
What is a Tree? 7:25
-
Why Tree? 2:40
-
Tree Terminology 5:16
-
Creating a Basic Tree in Java 9:43
-
What is A Binary Tree? 3:09
-
Types of Binary Tree 3:48
-
Binary Tree Representation 7:34
-
Create Binary Tree using Linked List 6:09
-
PreOrder Traversal in Binary Tree using Linked List 12:01
-
InOrder Traversal in Binary Tree using Linked List 8:48
-
PostOrder Traversal in Binary Tree using Linked List 7:02
-
LevelOrder Traversal in Binary Tree using Linked List 8:46
-
Search Method in Binary Tree (Linked List) 9:30
-
Insert Method in Binary Tree (Linked List) 12:36
-
Delete a Node in Binary Tree (Linked List) 20:29
-
Delet Entire Binary Tree (Linked List) 2:39
-
Create Binary Tree (Array) 7:27
-
Insert Method Binary Tree (Array) 7:56
-
PreOrder Traversal Binary Tree (Array) 7:25
-
InOrder Traversal Binary Tree (Array) 6:24
-
PostOrder Traversal Binary Tree (Array) 5:23
-
LevelOrder Traversal Binary Tree (Array) 5:44
-
Search Method Binary Tree (Array) 7:06
-
Delete a Node Binary Tree (Array) 6:32
-
Delete Binary Tree (Array) 3:06
-
Array vs Linked List in Binary Tree Implementation 6:00
-
Download Resources
Chương 23 Coding Exercises Tree/Binary Tree 7 bài
-
Implement Binary Tree
-
In-Order Traversal (Iterative)
-
Solution to In-Order Traversal (Iterative) / Time and Space Complexity
-
Pre-Order Traversal (Iterative)
-
Solution to Pre-Order Traversal (Iterative) / Time and Space Complexity
-
Post-Order Traversal (Iterative)
-
Solution to Post-Order Traversal (Iterative) / Time and Space Complexity
Chương 24 Binary Search Tree 12 bài · 1 giờ 9 phút
-
What is a Binary Search Tree? Why do we need it? 3:28
-
Create Binary Search Tree 4:37
-
Insert a Node to Binary Search Tree 12:06
-
PreOrder Traversal Binary Search Tree 4:44
-
InOrder Traversal Binary Search Tree 4:09
-
PostOrder Traversal Binary Search Tree 3:40
-
Level Order Traversal Binary Search Tree 5:11
-
Search in Binary Search Tree 7:41
-
Delete a Node in Binary Search Tree 17:18
-
Delete BST 2:50
-
Time and Space Complexity of BST 3:36
-
Download Resources
Chương 25 AVL Tree 16 bài · 2 giờ 15 phút
-
What is an AVL Tree? 7:23
-
Why Do We Need AVL Tree? 3:59
-
Common Operations on AVL Tree 12:17
-
Insert a Node in AVL (Left Left Condition) 13:32
-
Insert a Node in AVL (Left Right Condition) 8:30
-
Insert a Node in AVL (Right Right Condition) 8:00
-
Insert a Node in AVL (Right Left Condition) 6:36
-
Insert a Node in AVL (All Together) 14:26
-
Insert a Node in AVL (Method in Practice) 21:04
-
Delete a Node from AVL (LL, LR, RR, RR) 10:04
-
Delete a Node from ALL (All Together) 7:04
-
Delete a Node from AVL (Method in practice) 13:41
-
Delete Entire AVL Tree 2:10
-
Time and Space Complexity of AVL 3:02
-
Binary Search Tree vs AVL 2:56
-
Download Resources
Chương 26 Binary Heap 7 bài · 1 giờ 9 phút
-
What is Binary Heap? Why do we need Binary Heap? 7:39
-
Common Operations on Binary Heap 18:47
-
Insert a Node in Binary Heap 14:45
-
Extract a Node from Binary Heap 19:19
-
Delete Entire Binary Heap 2:45
-
Time and Space Complexity of Binary Heap 5:30
-
Download Resources
Chương 27 Trie 7 bài · 1 giờ 4 phút
-
What is a Trie? Why we need Trie? 10:57
-
Common Operations on a Trie (Creation) 6:23
-
Insert a String in Trie 14:41
-
Search for a String in Trie 13:00
-
Delete a String from Trie 16:57
-
Practical Uses of Trie 2:14
-
Download Resources
Chương 28 Hashing 14 bài · 1 giờ 50 phút
-
What is Hashing? Why we need it? 5:37
-
Hashing Terminology 4:45
-
Hash Functions 9:46
-
Types of Collision Resolution Techniques - Direct Chaining (Insert) 16:51
-
Direct Chaining Implementation - (Search, Delete) 7:28
-
Hash Table is Full 4:40
-
Collision Resolution Technique - Linear Probing (Insert) 17:44
-
Collision Resolution Technique - Linear Probing (Search, Delete) 8:38
-
Collision Resolution Technique - Open Addressing : Quadratic Probing 9:11
-
Collision Resolution Technique - Open Addressing : Double Hashing 13:49
-
Pros and Cons of Resolution Techniques 5:10
-
Practical Use of Hashing 4:17
-
Hashing vs Other DS 2:09
-
Download Resources
Chương 29 Sorting Algorithms 12 bài · 2 giờ 15 phút
-
What is Sorting? 2:59
-
Types of Sorting 6:51
-
Sorting Terminology 5:09
-
Bubble Sort 15:44
-
Selection Sort 11:34
-
Insertion Sort 13:50
-
Bucket Sort 21:10
-
Merge Sort 15:48
-
Quick Sort 22:09
-
Heap Sort 18:20
-
Comparison of Sorting Algorithms 1:29
-
Download Resources
Chương 30 Searching Algorithms 7 bài · 34 phút
-
Introduction To Search Algorithms 1:44
-
Linear Search 4:00
-
Linear Search in Java 7:11
-
Binary Search 3:03
-
Binary Search in Java 13:03
-
Time Complexity of Binary Search 5:14
-
Download Resources
Chương 31 Graphs 8 bài · 50 phút
-
What you will learn 1:40
-
What is a Graph? Why do we need Graph 4:48
-
Graph Terminology 5:04
-
Types of Graph 5:46
-
Graph Representation 9:54
-
Graph in Java using Adjacency Matrix 12:56
-
Graph in Java using Adjacency List 9:50
-
Download Resources
Chương 32 Graph Traversal - Breadth First Search and Depth First Search Algorithms 10 bài · 60 phút
-
Breadth First Search Algorithm (BFS) 10:36
-
Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix 11:21
-
Breadth First Search Algorithm (BFS) in Java - Adjacency List 6:29
-
Time Complexity of Breadth First Search (BFS) Algorithm 3:24
-
Depth First Search (DFS) Algorithm 7:22
-
Depth First Search (DFS) Algorithm in Java - Adjacency List 6:34
-
Depth First Search (DFS) Algorithm in Java - Adjacency Matrix 6:34
-
Time Complexity of Depth First Search (DFS) Algorithm 3:07
-
BFS Traversal vs DFS Traversal 4:32
-
Download Resources
Chương 33 Topological Sort 6 bài · 34 phút
-
What is Topological Sort? 2:56
-
Topological Sort Algorithm 9:13
-
Topological Sort using Adjacency List 10:55
-
Topological Sort using Adjacency Matrix 7:23
-
Time and Space Complexity of Topological Sort 3:13
-
Download Resources
Chương 34 Single Source Shortest Path Problem (SSSPP) 8 bài · 39 phút
-
What is Single Source Shortest Path Problem? 4:45
-
Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP) 7:03
-
BFS for SSSPP in Java using Adjacency List 11:08
-
BFS for SSSPP in Java using Adjacency Matrix 7:24
-
Time and Space Complexity of BFS for SSSPP 2:50
-
Why does BFS not work with Weighted Graph? 3:37
-
Why does DFS not work for SSSP? 2:15
-
Download Resources
Chương 35 Dijkstra's Algorithm 5 bài · 31 phút
-
Dijkstra's Algorithm for SSSPP 6:22
-
Dijkstra's Algorithm in Java - 1 12:35
-
Dijkstra's Algorithm in Java - 2 8:46
-
Dijkstra's Algorithm with Negative Cycle 3:46
-
Download Resources
Chương 36 Bellman Ford Algorithm 6 bài · 35 phút
-
Bellman Ford Algorithm for SSSPP 10:55
-
Bellman Ford Algorithm with Negative Cycle 5:18
-
Why Bellman Ford runs V-1 times? 4:20
-
Bellman Ford Algorithm Implementation in Java 10:45
-
BFS vs Dijkstra vs Bellman Ford 3:37
-
Download Resources
Chương 37 All Pairs Shortest Path Problem 2 bài · 9 phút
-
What is All Pairs Shortest Path Problem? 4:22
-
Dry Run for All Pairs Shortest Path Problem 4:24
Chương 38 Floyd Warshall Algorithm 6 bài · 32 phút
-
Floyd Warshall Algorithm 9:10
-
Why Floyd Warshall Algorithm? 4:49
-
Floyd Warshall with Negative Cycle 2:33
-
Floyd Warshall in Java 12:27
-
BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall Algorithms 2:42
-
Download Resources
Chương 39 Minimum Spanning Tree (Disjoint Set) 4 bài · 19 phút
-
What is Minimum Spanning Tree? 4:33
-
What is Disjoint Set? 2:55
-
Disjoint Set in Java 11:50
-
Download Resources
Chương 40 Kruskal and Prim's Algorithms 6 bài · 44 phút
-
Kruskal Algorithm 9:11
-
Kruskal Algorithm in Java 15:44
-
Prim's Algorithm 5:41
-
Prim's Algorithm in Java 9:58
-
Kruskal vs Prim's Algorithms 3:34
-
Download Resources
Chương 41 Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook) 15 bài · 12 phút
-
Introduction 0:39
-
Route Between Nodes
-
Solution to Route Between Nodes 10:51
-
Minimal Tree
-
Solution to Minimal Tree
-
Check Balanced
-
Solution to Check Balanced
-
Validate BST
-
Solution to Validate BST
-
Successor
-
Solution to Successor
-
BuildOrder
-
Solution to Build Order
-
Find Common Ancestor
-
Solution to Find Common Ancestor
Chương 42 Greedy Algorithms 9 bài · 1 giờ 12 phút
-
What is Greedy Algorithm? 5:36
-
Known Greedy Algorithms 8:30
-
Activity Selection Problem 5:36
-
Activity Selection Problem in Java 17:06
-
Coin Change Problem 4:26
-
Coin Change Problem in Java 8:10
-
Fractional Knapsack Problem 5:22
-
Fractional Knapsack Problem in Java 17:08
-
Download Resources
Chương 43 Divide and Conquer Algorithms 20 bài · 1 giờ 59 phút
-
What is a Divide and Conquer Algorithm? 6:58
-
Common Divide and Conquer Algorithms 6:51
-
How to solve Fibonacci series using Divide and Conquer approach? 4:59
-
Number Factor 6:25
-
Number Factor in Java 5:44
-
House Robber 7:10
-
House Robber in Java 6:28
-
Convert One String to Another 6:15
-
Convert One String to Another in Java 7:55
-
Zero One Knapsack Problem 5:10
-
Zero One Knapsack Problem in Java 7:50
-
Longest Common Subsequence Problem 6:22
-
Longest Common Subsequence Problem in Java 7:03
-
Longest Palindromic Subsequence Problem 5:46
-
Longest Palindromic Subsequence Problem in Java 6:19
-
Minimum Cost to Reach Last Cell 5:02
-
Minimum Cost to Reach Last Cell in Java 5:06
-
Number of Paths To Reach The Last Cell with Given Cost 5:16
-
Number of Paths To Reach The Last Cell with Given Cost in Java 6:09
-
Download Resources
Chương 44 Divide and Conquer CODING EXERCISES 6 bài
-
Divide and Conquer - countZeroes
-
Solution to Divide and Conquer - countZeroes
-
Divide and Conquer - sortedFrequency
-
Solution to Divide and Conquer - sortedFrequency
-
Divide and Conquer - findRotatedIndex
-
Solution to Divide and Conquer - findRotatedIndex
Chương 45 Dynamic Programming 20 bài · 1 giờ 12 phút
-
What is Dynamic Programming? (Overlapping property) 4:57
-
Where Does the Name of DP Come From? 2:08
-
Top Down with Memoization 11:27
-
Bottom Up with Tabulation 7:43
-
Top Down vs Bottom Up 4:17
-
Is Merge Sort Dynamic Programming? 4:29
-
Number Factor Problem using Dynamic Programming 12:26
-
Number Factor Top Down Approach
-
Number Factor Bottom Up Approach
-
Number Factor : Top Down and Bottom Up 8:33
-
House Robber Problem using Dynamic Programming 10:23
-
House Robber Top Down Approach
-
Solution to House Robber Top Down Approach
-
House Robber Bottom Up Approach
-
Solution to House Robber Bottom Up Approach
-
Convert one string to another using Dynamic Programming 5:29
-
Convert One String to Another using Top Down Approach
-
Solution to Convert One String to Another using Top Down Approach
-
Convert One String to Another using Bottom Up Approach
-
Solution to Convert One String to Another using Bottom Up Approach
Chương 46 CHALLENGING Dynamic Programming Problems 15 bài
-
NOTE ON THIS SECTION
-
Longest repeated Subsequence Length problem
-
Solution to Longest repeated Subsequence Length problem
-
Longest Common Subsequence Length problem using Top Down Approach
-
Solution to Longest Common Subsequence Length problem using Top Down Approach
-
Longest Common Subsequence Length problem using Bottom Up Approach
-
Solution to Longest Common Subsequence Length problem using Bottom Up Approach
-
Longest Common Subsequence
-
Solution to Longest Common Subsequence
-
Longest Palindromic Subsequence using Top Down Approach
-
Solution to Longest Palindromic Subsequence using Top Down Approach
-
Longest Palindromic Subsequence using Bottom Up Approach
-
Solution to Longest Palindromic Subsequence using Bottom Up Approach
-
Longest Palindromic Substring
-
Solution to Longest Palindromic Substring
Chương 47 A Recipe for Problem Solving 6 bài · 42 phút
-
Introduction 2:57
-
Step 1 - Understand the Problem 6:01
-
Step 2 - Examples 6:40
-
Step 3 - Break it Down 7:43
-
Step 4 - Solve or Simplify 10:55
-
Step 5 - Look Back and Refactor 7:32
Chương 48 Backtracking 5 bài · 24 phút
-
What is Backtracking? 10:01
-
Backtracking vs Brute Force 4:34
-
Backtracking Quiz
-
N - Queens Problem 9:38
-
N - Queens problem in Java
Chương 49 My Other Courses 1 bài
-
Bonus Lecture
Requirment
-
Basic Java Programming skills
Outcomes
-
Learn, implement, and use different Data Structures
-
Learn, implement and use different Algorithms
-
Become a better developer by mastering computer science fundamentals
-
Learn everything you need to ace difficult coding interviews
-
Cracking the Coding Interview with 100+ questions with explanations
-
Time and Space Complexity of Data Structures and Algorithms
-
Recursion
-
Big O
-
Dynamic Programming
-
Divide and Conquer Algorithms
-
Graph Algorithms
-
Greedy Algorithms
0 Student
2 Courses
0 review