Data structure and Algorithm in Java 2024 | Java DSA Full Tutorial in 5 Hours
Welcome to my Channel...!
☕ BuyMeACoffee: buymeacoffee.com/missgoogle
PHP Full Playlist:-👇👇👇
• PHP Tutorials for Beginners to Master | Le...
JavaScript Full Playlist:-👇👇👇
• JavaScript Tutorials | Learn A-Z Concepts ...
ReactJS Full Playlist:👇👇👇
• ReactJS Tutorials | Learn A-Z Concepts in ...
Full-Stack MERN App Development tutorial:-👇👇👇
• Video
Creating and Hosting Full-Stack Site using React:-👇👇👇
• Creating and Hosting a Full-Stack Site usi...
→→→→→Visit Our Channel For More Videos←←←←←
//Chapters and time splits
00:00:00-00:01:08 Introduction
00:01:09-00:05:57 Euclid's algorithm
00:05:58-00:08:49 Bubble sort algorithm
00:08:50-00:11:58 Why we study data structure and algorithms?
00:11:59-00:13:33 Correctness of an algorithm
00:13:34-00:16:53 Introduction- Analysis of Algorithm
00:16:54-00:19:45 how to calculate the time complexity
00:19:46-00:21:52 The RAM model of computation
00:21:53-00:25:16 Time complexity of bubble sort algorithm
00:25:17-00:28:18 Pseudo code: Bubble sort algorithm
00:28:19-00:31:44 The Big O notation
00:31:45-00:36:25 Using Big O notation: Examples
00:36:26-00:40:27 Comparison of running times
00:40:28-00:43:15 Selection sort
00:43:16-00:45:49 Selection sort: Pseudocode
00:45:50-00:47:45 Introduction to insertion sort
00:47:46-00:49:53 Applying insertion sort algorithm to cue balls
00:49:54-00:52:31 Insertion sort: Pseudocode
00:52:32-00:54:30 O(n^2) sorting algorithms: Comparison
00:54:31-00:58:16 Stable vs unstable sorts
00:58:17-01:01:32 Searching elements in an unordered array
01:01:33-01:04:05 Searching elements in an ordered array
01:04:06-01:09:53 Search elements in an ordered array continued
01:09:54-01:12:01 Inserting and deleting items in an ordered array
01:12:02-01:13:34 Sorting any type of object
01:13:35-01:16:55 What is a linked list?
01:16:56-01:17:51 Implementing a linked list in Java
01:17:52-01:23:16 Inserting a new node
01:23:17-01:25:27 Length of a linked list
01:25:28-01:27:38 Deleting the head node
01:27:39-01:30:49 Searching for an item
01:30:40-01:33:54 Doubly ended lists
01:33:55-01:38:32 Inserting data in a sorted linked list
01:38:33-01:45:00 Doubly linked list
01:45:01-01:55:32 Insertion sort revisited
01:55:33-01:58:13 Stacks
01:58:14-01:58:50 Abstract data types
01:58:00-02:02:11 Implementing stacks using arrays
02:02:12-02:04:43 Queues
02:04:44-02:10:12 Queues using arrays
02:10:13-02:12:10 Double-ended queues
02:12:11-02:16:30 Double-ended queues using arrays
02:16:31-02:21:02 Introduction- Recursion
02:21:03-02:24:06 Understanding recursion
02:24:07-02:26:54 Tail recursion
02:26:55-02:35:18 Tower of Hanoi
02:35:19-02:38:16 Tower of Hanoi: Implementation
02:38:17-02:42:25 Merge sort
02:42:26-02:46:49 Merge sort: Pseudocode
02:46:50-02:51:21 Merge step: Pseudocode
02:51:22-02:54:13 Time complexity of merge sort
02:54:14-02:57:54 The tree data structure
02:57:55-03:01:28 Binary trees
03:01:29-03:03:29 Binary search trees
03:03:30-03:05:53 Finding an item in a binary search tree
03:05:54-03:08:55 Implementing the find method
03:08:56-03:12:29 Inserting an item in a binary search tree
03:12:30-03:18:34 Deleting an item: Case 1
03:18:35-03:21:32 Deleting an item: Case 2
03:21:33-03:25:16 Deleting an item: Case 3
03:25:17-03:26:56 Deleting an item: Soft delete
03:26:57-03:29:29 Finding smallest and largest values
03:29:30-03:32:48 Tree traversal: In order
03:32:49-03:34:46 Tree traversal: Pre order
03:34:47-03:35:42 Tree traversal: Post order
03:35:43-03:37:58 Unbalanced trees vs balanced trees
03:37:59-03:39:32 Height of a binary tree
03:39:33-03:41:48 Time complexity of operations on binary search tree
03:41:49-03:43:15 Introduction- More Sorting Algorithms
03:43:16-03:48:08 Quick sort
03:48:09-03:50:29 Quick sort: The partition step
03:50:30-03:55:56 Shell sort
03:55:57-03:59:24 Shell sort example
03:59:25-04:04:14 Counting sort
04:04:15-04:06:41 Redix sort
04:06:42-04:09:52 Bucket sort
04:09:53-04:13:58 Introduction- Heaps
04:13:59-04:15:51 Deleting the root
04:15:52-04:17:50 Inserting an item in a heap
04:17:51-04:20:20 Heaps vs Priority queues
04:20:21-04:22:15 Representing heaps using arrays
04:22:16-04:24:45 Heap sort
04:24:46-04:28:52 Building a heap
04:28:53-04:31:32 Introduction- Hash tables
04:31:33-04:33:36 Direct access tables
04:33:37-04:35:13 Hashing
04:35:14-04:39:29 Resolving collisions through chaining
04:39:30-04:45:45 The hash function
04:45:46-04:48:43 Open addressing to resolve collisions
04:48:44-04:52:02 Strategies for open addressing
04:52:03-04:55:22 Time complexity: Open addressing