4.68 out of 5
4.68
19786 reviews on Udemy

# Data Structures & Algorithms – Interview !!

Learn Data Structures and Algorithms from Scratch. Start from basic Data Structure and move on till Intermediate level.
Instructor:
DS Guy
45,453 students enrolled
English [Auto-generated]
You will get complete knowledge on Data Structures and Algorithms
You will be able to find time complexity of any given algorithm.
Will be able to answer "WHY" part behind use of every data structure.
Will get to know Real time uses of all Data Structures.

Hey Friends,

This course is for all those people who want to learn data structure from absolute basic to advanced level. We don’t expect you to have any prior knowledge on Data Structure, but a basicÂ prior knowledge of Java will be helpful. We are planning to launch a forum exclusively for students. The objective of this forum will be address all the questions which the students might have post the lecture.

### S01 -- Introduction to Data Structure & Algorithms

1
S01 - L01 -- Course Breakdown
2
S01 - L02 -- What is DS and Algo
3
S01 - L03 -- Why companies ask DS
4
S01 - L04 -- DS in every day life
5
S01 - L05 -- Types of DS
6
QUIZ-Introduction

### S01.1 -- Recursion

1
S01.1-L01--What is Recursion
2
S01.1-L02--Why learn Recursion
3
S01.1-L03--Format of Recursion Method
4
5
S01.1-L05--Finding Factorial using Recursion
6
S01.1-L06--Finding Fibonacci using Recursion
7
S01.1-L07--Recursion vs Iteration
8
S01.1-L08--When to Use & Avoid Recursion
9
S01.1-L09--Practical Uses of Recursion

### S02 -- Algorithm Run Time Analysis

1
S02-L01 -- What is Algo Run Time Analysis
2
S02-L02 -- What are Notations
3
S02-L03 -- Examples of Notations
4
S02-L04 -- Examples of Time Complexity
5
S02-L05 -- Finding Time Complexity of Iterative Algo
6
S02-L06 -- Finding Time Complexity of Recursive Algo#1
7
S02-L07 -- Finding Time Complexity of Recursive Algo#2

### S03 -- Array

1
S03 - L01 -- What and Why of Array
2
S03 - L02 -- Types of Array
3
S03 - L03 -- How is Array represented in Memory
4
S03 - L04 -- Create an Array
5
S03 - L05 -- Insert Traverse in 1D Array
6
S03 - L06 -- Access Search Delete in 1D Array
7
S03 - L07 -- Code 1D Array
8
S03 - L08 -- Time Complexity of 1D Array
9
S03 - L09 -- Create 2D Array
10
S03 - L10 -- 2D Array operations
11
S03 - L11 -- Time Complexity of 2D Array
12
S03 - L12 -- When to use Array
13
S03 - L13 -- Code 2D Array
14
S03 - L14 -- Practical uses of Array

1
S04 - L01 -- What is linked list
2
S04 - L02 -- Linked list vs Array
3
S04 - L03 -- Components of LinkedList
4
S04 - L04 -- Types of LinkedList
5
S04 - L05 -- Why so many types of LinkedList
6
S04 - L06 -- How is LinkedList stored in Memory
7
S04 - L07 -- Creation of Single LinkedList (SLL)
8
S04 - L08 -- Insertion in SLL - Dry Run
9
S04 - L09 -- Insertion in SLL - Algo
10
S04 - L10 -- Traversal of SLL
11
S04 - L11 -- Search node in SLL
12
S04 - L12 -- Deletion of node from SLL - Dry Run
13
S04 - L13 -- Deletion of node from SLL - Algo
14
S04 - L14 -- Delete entire SLL
15
S04 - L15 -- Time Complexity of SLL
16
S04 - L16 -- Creation of Circular Single LinkedList (CSLL)
17
S04 - L17 -- Insertion of data in CSLL - Dry Run
18
S04 - L18 -- Insertion of data in CSLL - Algo
19
S04 - L19 -- Traverse CSLL
20
S04 - L20 -- Search a node in CSLL
21
S04 - L21 -- Delete a node from CSLL - Dry Run
22
S04 - L22 -- Deletion of node from CSLL - Algo
23
S04 - L23 -- Deletion of entire CSLL
24
S04 - L24 -- Time Complexity of CSLL
25
S04 - L25 -- Create Double Linked List (DLL)
26
S04 - L26 -- Insert node in DLL - Dry Run
27
S04 - L27 -- Insert node in DLL - Algo
28
S04 - L28 -- Traverse DLL
29
S04 - L29 -- Reverse Traversal of DLL
30
S04 - L30 -- Search a node in DLL
31
S04 - L31 -- Delete a node from DLL - Dry Run
32
S04 - L32 -- Delete a node from DLL - Algo
33
S04 - L33 -- Delete entire DLL
34
S04 - L34 -- Time Complexity of DLL
35
S04 - L35 -- Create Double Circular LinkedList (CDLL)
36
S04 - L36 -- Insert node in CDLL - Dry Run
37
S04 - L37 -- Insert node in CDLL - Algo
38
S04 - L38 -- Traverse CDLL
39
S04 - L39 -- Reverse traverse CDLL
40
S04 - L40 -- Search a node in CDLL
41
S04 - L41 -- Delete a node from CDLL - Dry Run
42
S04 - L42 -- Delete a node from CDLL - Algo
43
S04 - L43 -- Delete entire CDLL
44
S04 - L44 -- Time Complexity of CDLL
45
S04 - L45 -- SLL vs CSLL vs DLL vs DLL
46
S04 - L46 -- Practical uses of LinkedList

### S05 -- Stack

1
L01 -- What and Why of Stack
2
L02 -- ARRAY - Create & Push
3
L03 -- ARRAY - Pop, Peek, isEmpty, isFull, Delete
4
L04 -- LinkedList - Create, Push, Pop
5
L05 -- LinkedList - Peek, Delete
6
L06 -- When to use or avoid Stack

### S06 -- Queue

1
S06 - L01 -- What and Why of Queue
2
S06 - L02 -- LINEAR QUEUE(Array) - Create, Enqueue
3
S06 - L03 -- LINEAR QUEUE((Array)) - deQueue, isEmpty, isFull, Delete
4
S06 - L04 -- Why Circular Queue
5
S06 - L05 -- CIRCULAR QUEUE(Array) - Enqueue
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
4.7
4.7 out of 5
19786 Ratings

#### Detailed Rating

 Stars 5 17984 Stars 4 1158 Stars 3 224 Stars 2 282 Stars 1 125
30-Day Money-Back Guarantee

#### Includes

29 hours on-demand video