# Data Structures & Algorithms – Interview !!

Data Structures & Algorithms – Interview !!
English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 12 Hours | 2.62 GB

Graph videos are next. They will be live soon.

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.

What you’ll learn

• You will get complete knowledge on Data Structures and will be able to implement it in Java.
• You will be able to find time complexity of any given algorithm.
• Will be able to Crack Top Product Companies interview.
• Will get to know Real time uses of all Data Structures.
• Master Data Structure and Algorithm from Beginner > Intermediate > Advanced Level.
• Will be able to answer “WHY” part behind use of every data structure.
• Quiz at the end of every chapter to reinforce learning.

S01 Course Setup
1 S01-L01 Course FAQs
2 S01-L02Course Breakdown

S02 Introduction to Data Structures Algo
3 S02-L01 Layman terminologies
4 S02-L02 Why learn Data Structure Algorithm

Recursion
5 S03-L01–What is Recursion
6 S03-L02–Why learn Recursion
7 S03-L03–Format of Recursion Method
9 S03-L05–Finding Factorial using Recursion
10 S03-L06–Finding Fibonacci using Recursion
11 S03-L07–Recursion vs Iteration
12 S03-L08–When to Use Avoid Recursion
13 S03-L09–Practical Uses of Recursion

S03 Array
14 S03-L01 Why learn Array
15 S03-L02 Types of Array
16 S03-L03 How is Array stored in RAM
17 S03-L04 ARRAY OPERATION – Create (1D)
18 S03-L05 ARRAY OPERATION – Insert Traverse (1D)
19 S03-L06 ARRAY OPERATION – Access Search Delete (1D)
20 S03-L07 Time Space Complexity of all operations (1D)
21 S03-L08 Java Code of 1D Array
22 S03-L09 ARRAY OPERATION – Create 2D Array
23 S03-L10 ARRAY OPERATION – Insert Traverse Search Delete (2D)
24 S03-L011 Time Space Complexity of all operations (2D)
25 S03-L12 When to UseAvoid Array
26 S03-L13 Java Code of 2D Array
27 S03-L14 Practical uses of Array

28 S04 – L01 — What is linked list
29 S04 – L02 — Linked list vs Array
30 S04 – L04 — Components of Linked List
31 S04 – L05 — Types of Linked List
32 S04 – L06 — Why so many types of Linked List
33 S04 – L07 — How is linked list stored in RAM
34 S04 – L08 — OPERATION – Creation of Single Linked List
35 S04 – L09 — OPERATION – Insertion in Single Linked List – Part1
36 S04 – L10 –OPERATION – Insertion in Single Linked List – Part2
37 S04 – L11 — OPERATION – Traversal of Single Linked List
38 S04 – L12 –OPERATION – Searching in Single Linked List
39 S04 – L13 — OPERATION – Deletion from Single Linked List – Part1
40 S04 – L14 — OPERATION – Deletion from Single Linked List – Part2
41 S04 – L15 –OPERATION – Deletion of entire Single Linked List
42 S04 – L16 — Time Complexity of Single Linked List
43 S04 – L17 — OPERATION – Create of Single Circular Linked List
44 S04 – L18 — OPERATION – Insertion in Single Circular Linked List – Part1
45 S04 – L19 –OPERATION – Insertion in Single Circular Linked List – Part2
46 S04 – L20 — OPERATION – Traverse of Single Circular Linked List
47 S04 – L21 — OPERATION – Searching in Single Circular Linked List
48 S04 – L22 — OPERATION – Deletion from Single Circular Linked List – Part1
49 S04 – L23 — OPERATION – Deletion from Single Circular Linked List – Part2
50 S04 – L24 — OPERATION – Deletion of entire Single Circular Linked List
51 S04 – L25 — Time Complexity of Single Circular Linked List
52 S04 – L26 — OPERATION – Create of Double Linked List
53 S04 – L27 — OPERATION – Insertion in Double Linked List – Part1
54 S04 – L28 — OPERATION – Insertion in Double Linked List – Part2
55 S04 – L29 – OPERATION – Traverse of Double Linked List
56 S04 – L30 — OPERATION – Reverse Traverse of Double Linked List
57 S04 – L31 — OPERATION – Searching in Double Linked List
58 S04 – L32 — OPERATION – Deletion from Double Linked List – Part1
59 S04 – L33 — OPERATION – Deletion from Double Linked List – Part2
60 S04 – L34 — OPERATION – Deletion of entire Double Linked List
61 S04 – L35 — Time Complexity of Double Linked List
62 S04 – L36 — OPERATION – Create of Double Circular Linked List
63 S04 – L37 — OPERATION – Insertion in Double Circular Linked List – Part1
64 S04 – L38 — OPERATION – Insertion in Double Circular Linked List – Part2
65 S04 – L39 — OPERATION – Traverse of Double Circular Linked List
66 S04 – L40 –OPERATION – Reverse Traverse of Double Circular Linked List
67 S04 – L41 — OPERATION – Searching in Double Circular Linked List
68 S04 – L42 — OPERATION – Deletion from Double Circular Linked List-Part1
69 S04 – L43 — OPERATION – Deletion from Double Circular Linked List-Part2
70 S04 – L44 — OPERATION – Deletion of entire Double Circular Linked List
71 S04 – L45 — Time Complexity of Double Circular Linked List
72 S04 – L46 — Time Compexity compared
73 S04 – L47 — Practical uses of Linked List

S05 Stack
74 Introduction to Stack
75 Common Operations of Stack
76 Practical Use of Stack
77 How is Linked List stored in Memory
78 Pros Cons of Stack
79 Stack vs Other DS

S06 Queue
80 Introduction to Queue
81 Common Operations of Queue
82 Practical Use of Queue
83 Pros Cons of Queue
84 Queue vs Other DS

S07 – Hashing
85 Introduction to Hashing
86 Why learn Hashing
87 Introduction to Hash Functions
88 Types of Collision Resolution Techniques
89 What happens when Hash Table is full
90 Collision Resolution Techniques Compared
91 Practical Use of Hashing
92 Hashing vs Other DS

OBSOLETE VIDEOS
93 Introduction to Array