Complete Data Structures and Algorithm Masterclass | DSA Course [With FREE Source CODE]

Published: 24 March 2024
on channel: EmbarkX | Learn Programming | Faisal Memon

31,773

1.4k

This is the complete DSA [Data Structures and Algorithms] Masterclass using Java and IntelliJ.

DO YOU WANT FREE NOTES FOR DSA? COMMENT AND LET ME KNOW, I WOULD RELEASE IT FOR "FREE"

Join our community on Telegram for FREE courses: https://link.embarkx.com/telegram

RELEASING THE SOURCE CODE FOR THE ENTIRE SERIES FOR FREE FOR MY SUBSCRIBERS: https://bit.ly/dsa-bonus

** LEARN AND GROW AS A JAVA DEVELOPER **
1. SPRING BOOT BY BUILDING COMPLEX PROJECT STEP BY STEP [47+ HOURS OF CONTENT]: https://link.embarkx.com/spring-boot
2. LEARN JAVA WITH 60+ HOURS OF CONTENT: https://link.embarkx.com/java
3. MASTER INTELLIJ IDEA: http://link.embarkx.com/intellij

MORE FREE COURSES HERE: https://link.embarkx.com/all

FOLLOW ME: https://link.embarkx.com/linkedin

Join community for SOURCE CODE and updates: https://link.embarkx.com/telegram

For taking this course you just need to know Java.

TIME STAMPS:

TIME STAMPS:
00:00 COURSE INTRODUCTION

FUNDAMENTALS
00:02:09 Introduction to Data Structures
00:12:37 What are Algorithms
00:23:27 Complexity
00:27:13 Time Complexity
00:32:50 Space Complexity

LINKED LISTS
00:35:29 What is a LinkedList
00:40:43 LinkedList vs Arrays
00:47:02 Types of LinkedList

SINGLY LINKED LIST
00:48:49 Singly LinkedList
00:52:35 Creating a Singly LinkedList
00:58:33 Inserting a node in the beginning : prepend(data)
01:01:43 Traversing a Singly Linked List
01:06:19 Inserting a node at a position
01:13:08 Deleting a node in the beginning
01:16:56 Deleting a node at a given position

DOUBLY LINKED LIST
01:24:13 Doubly Linked List - Concept and Design
01:31:08 Creating a Doubly Linked List
01:37:30 Inserting a node in the beginning
01:44:14 Traversing a doubly linked list
01:50:34 Inserting at a position in doubly linked list
01:58:32 Inserting in the end in doubly linked list
02:02:54 Deleting a node in the beginning of doubly linked list
02:08:45 Deleting a node in the end of doubly linked list
02:13:25 Deleting a node at a given position of doubly linked list

STACK
02:20:34 Stack: Concept and Design
02:25:27 Creating and implementing Stack
02:29:55 push(), pop(), peak()

QUEUE
02:39:39 Queue - concept and design
02:44:37 Creating and implementing a Queue
02:49:15 enQueue(), deQueue() with Queue

PRIORITY QUEUE
02:57:23 Priority Queue : Concept and design
03:01:35 Creating a Priority Queue
03:05:50 insert() and size() in Priority Queue
03:11:33 peekMax() and popMax() in Priority Queue

BINARY TREE
03:18:59 Binary Tree - Concept and design
03:23:29 Creating and implementing binary tree
03:28:20 Traversing a binary tree : preorder, inorder and postorder
03:33:42 Preorder traversal : Algorithm and implementation
03:40:22 Inorder traversal : Algorithm and implementation
03:44:26 Postorder traversal : Algorithm and implementation

BINARY SEARCH TREE
03:48:25 Binary Search Tree - Concept and Design
03:52:40 Creating and implementing Binary Search Tree
03:56:54 Searching with Binary Search Tree
04:01:53 Inserting into Binary Search Tree
04:08:35 Deletion with Binary Search Tree

GRAPH
04:19:19 Graph - Concept and Design
04:30:45 Edge list implementation - conceptual overview
04:36:22 Edge list implementation using java
04:42:49 Inserting vertex : Algorithm and implementation
04:46:22 vertices() : Algorithm and implementation
04:49:47 Inserting Edge : Algorithm and implementation
04:53:17 edges() : Algorithm and implementation
04:56:32 Removing vertex : Algorithm and implementation
05:00:10 Removing Edge : Algorithm and implementation
05:03:41 incidentEdges() : Algorithm and implementation
05:08:13 opposite() : Algorithm and implementation
05:11:54 areAdjacent() : Algorithm and implementation
05:16:22 replace() for vertex and an edge : Algorithm and implementation
05:21:28 Adjacency-matrix representation - conceptual overview
05:27:08 Adjacency-list representation - conceptual overview

MAPS
05:29:26 Maps - Concept and Design
05:34:09 Creating and implementing Maps
05:43:58 get() : Algorithm and Implementation
05:48:23 put() : Algorithm and Implementation
05:54:37 remove() : Algorithm and Implementation
06:00:30 Hashmaps

SORTING ALGORITHMS
06:02:48 Understanding Bubble sort
06:10:30 Implementing BubbleSort
06:14:50 Understanding selection sort
06:23:42 Implementing selection sort
06:27:20 Understanding insertion sort
06:36:49 Implementing insertion sort
06:40:27 Understanding Merge sort
06:54:34 Implementing Merge sort
07:01:47 Understanding QuickSort
07:15:17 Implementing QuickSort

SEARCHING ALGORITHMS
07:20:13 Understanding Linear search
07:25:20 Implementing Linear search
07:28:27 Understanding Binary search
07:35:46 Implementing Binary search

THANK YOU
FAISAL MEMON

On this page of the site you can watch the video online Complete Data Structures and Algorithm Masterclass | DSA Course [With FREE Source CODE] with a duration of hours minute second in good quality, which was uploaded by the user EmbarkX | Learn Programming | Faisal Memon 24 March 2024, share the link with friends and acquaintances, this video has already been watched 31,773 times on youtube and it was liked by 1.4 thousand viewers. Enjoy your viewing!

13,912

323