Data Structures and Algorithms: The Complete Masterclass

Focused View

Shubham Sarda

19:52:02

14 View

01.01-course introduction.mp4

03:18

01.02-curriculum walkthrough.mp4

15:34

02.01-section introduction.mp4

01:43

02.02-complexity analysis.mp4

05:25

02.03-why we need big o notation.mp4

06:32

02.04-big o(n) complexity.mp4

07:47

02.05-big o(1) complexity.mp4

04:04

02.06-counting operations.mp4

03:32

02.07-simplifying big o-part 1.mp4

07:19

02.08-big o(n2) complexity.mp4

03:44

02.09-simplifying big o-part 2.mp4

02:35

02.10-big o(n) complexity.mp4

01:25

02.11-space complexity-part 1.mp4

04:39

02.12-space complexity-part 2.mp4

01:45

02.13-section summary.mp4

01:38

03.01-memory.mp4

11:25

03.02-logarithm.mp4

11:12

04.01-introduction to data structures.mp4

07:07

05.01-array introduction.mp4

04:40

05.02-array-common operations-part 1.mp4

08:02

05.03-array-common operations-part 2.mp4

08:04

05.04-static versus dynamic array-common operations-part 3.mp4

07:25

06.01-linked lists.mp4

25:54

06.02-linked list complexities.mp4

20:43

06.03-doubly linked list.mp4

07:27

06.04-circular linked list and implementing a linked list.mp4

15:29

07.01-stack and queue.mp4

26:18

08.01-hash tables.mp4

34:42

09.01-trees-part 1.mp4

17:32

09.02-trees-part 2.mp4

05:22

09.03-binary tree.mp4

13:49

09.04-binary search tree.mp4

28:57

09.05-adelson-vekskii landis (avl) trees versus red black trees.mp4

07:58

10.01-heaps.mp4

29:05

10.02-heap sort and priority queues.mp4

13:50

11.01-trie-i.mp4

12:59

11.02-trie-ii.mp4

20:33

11.03-why are tries important.mp4

03:04

12.01-graphs.mp4

32:08

13.01-what is recursion.mp4

07:14

13.02-recursion control of a function-part 1.mp4

07:00

13.03-recursion tracing tree-part 2.mp4

17:55

13.04-recursion understanding a call stack-part 3.mp4

16:10

13.05-recursion tree recursion-part 4.mp4

18:48

13.06-recursion example-factorial of a number.mp4

07:38

14.01-linear search.mp4

07:30

14.02-binary search.mp4

10:58

14.03-binary search complexity.mp4

04:34

14.04-implementing binary search-part 1.mp4

05:14

14.05-implementing binary search implementation-recursion-part 2.mp4

25:48

15.01-sorting algorithm-introduction.mp4

02:20

15.02-bubble sort.mp4

04:52

15.03-bubble sort visualization.mp4

02:25

15.04-implementing bubble sort.mp4

07:19

15.05-bubble sort complexity.mp4

03:32

15.06-selection sort.mp4

04:11

15.07-selection sort visualization.mp4

03:21

15.08-implementing selection sort.mp4

06:59

15.09-selection sort complexity.mp4

02:32

15.10-insertion sort.mp4

03:48

15.11-implementing insertion sort.mp4

07:43

15.12-insertion sort complexity.mp4

02:35

15.13-performance analysis.mp4

04:08

16.01-quick sort.mp4

22:21

16.02-quick sort complexity.mp4

12:52

16.03-implementing quicksort.mp4

10:58

16.04-merge sort.mp4

13:11

16.05-merge sort complexity.mp4

05:37

16.06-implementing merge sort.mp4

21:51

17.01-tree traversal.mp4

18:52

17.02-depth-first search-(preorder inorder and postorder).mp4

10:02

17.03-implementing a binary tree.mp4

09:54

17.04-implementing depth-first search.mp4

20:42

17.05-depth-first search complexity.mp4

03:18

17.06-breadth-first search-level order.mp4

10:10

17.07-implementing breadth-first search.mp4

13:26

17.08-breadth-first search complexity.mp4

02:20

18.01-graph traversal.mp4

05:55

18.02-implementing graph animation.mp4

08:08

18.03-implementing breadth-first search.mp4

14:27

18.04-implementing depth-first search.mp4

08:38

18.05-graph traversal complexity.mp4

03:29

19.01-implementing data structures.mp4

05:56

19.02-problem solving approach.mp4

09:36

20.01-two sum.mp4

12:52

21.01-min stacks.mp4

15:47

21.02-implementing a min stack.mp4

07:11

22.01-max stacks.mp4

04:03

23.01-designing a linked list-part i.mp4

12:16

23.02-designing a linked list-part 2.mp4

18:48

23.03-designing a linked list-part 3.mp4

12:14

23.04-designing a linked list-part 4.mp4

15:52

24.01-reversing linked list-i.mp4

23:02

24.02-reversing linked list-ii.mp4

05:37

25.01-traversal (preorder inorder and postorder).mp4

16:38

25.02-constructing a binary tree from preorder and inorder traversal-part 1.mp4

29:43

25.03-constructing a binary tree from preorder and inorder traversal-part 2.mp4

26:56

26.01-invert binary tree-part 1.mp4

20:10

26.02-invert binary tree-part 2.mp4

12:51

27.01-constructing a binary search tree from preorder traversal-part 1.mp4

27:43

27.02-constructing a binary search tree from preorder traversal-part 2.mp4

01:03

28.01-detect capital.mp4

15:03

29.01-reverse strings.mp4

13:13

30.01-longest palindromic substring-part 1.mp4

21:58

30.02-longest palindromic substring-part 2.mp4

17:18

31.01-thank you for being here.mp4

00:42

9781801078504 Code.zip

Description

With the knowledge of data structures and algorithms at your fingertips, you can write efficient computer programs to solve real-world problems. This course will help you to get up and running with data structures and algorithms in no time. The course starts by explaining the concepts of complexity analysis and big O notation. Next, you will become familiar with the concepts of memory and logarithms. Moving along, you will get a solid understanding of data structure concepts, such as arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs. Next, you will understand what recursion is and get to grips with a variety of basic and advanced algorithms, such as searching, sorting elementary, sorting advanced, tree traversal, and graph traversal. Towards the end, you will go through a set of interview questions that will enhance your knowledge of data structures and algorithms and prepare you for job interviews. By the end of this course, you will have gained exceptional knowledge of data structure and algorithms and will have developed skills to apply in the real world.

More details

User Reviews

Rating

average 0

Total votes0

Focused display

Algorithms

Data Structures

Shubham Sarda

Instructor's Courses

Shubham Sarda is a software developer and digital marketer with a passion for teaching. He has worked with many funded start-ups, self-projects, and as a top-rated freelancer on multiple marketplaces. Currently, he stands among the top 700 freelancers with over 2,500+ projects on Fiverr, PeoplePerHour, Freelancer, and more. As an instructor, he has taught programming and digital marketing to over 20,000 students, both with online courses and offline bootcamps. He has mastered explaining complex topics in the simplest form that is easy to understand and follow. His video courses are also used by companies to train their employees and by colleges to prepare and upgrade their students according to the latest industry requirements.

PacktPub

View courses PacktPub

Packt is a publishing company founded in 2003 headquartered in Birmingham, UK, with offices in Mumbai, India. Packt primarily publishes print and electronic books and videos relating to information technology, including programming, web design, data analysis and hardware.