Other
Data Structures & Algorithms Essentials (2021)
Torrent info
Torrent Files List
[TutsNode.com] - Data Structures & Algorithms Essentials (2021) (Size: 14.56 GB) (Files: 644)
[TutsNode.com] - Data Structures & Algorithms Essentials (2021)
23 Dynamic Programming Introduction
001 Dynamic Programming Basics.mp4
001 Dynamic Programming Basics.en.srt
002 Coin Change.en.srt
006 Knapsack Problem.en.srt
010 Wines - III.en.srt
007 Knapsack Problem Code.en.srt
011 Wines - IV.en.srt
004 Longest Common Subsequence (LCS).en.srt
008 Wines Problem.en.srt
003 Coin Change Code.en.srt
009 Wines Problem - II.en.srt
005 Longest Common Subsequence Code.en.srt
002 Coin Change.mp4
006 Knapsack Problem.mp4
007 Knapsack Problem Code.mp4
011 Wines - IV.mp4
010 Wines - III.mp4
009 Wines Problem - II.mp4
003 Coin Change Code.mp4
008 Wines Problem.mp4
004 Longest Common Subsequence (LCS).mp4
005 Longest Common Subsequence Code.mp4
11 Backtracking
005 Sudoku Code.en.srt
004 Sudoku.en.srt
003 Permutations.en.srt
002 Subsets.en.srt
001 Important Note!.html
005 Sudoku Code.mp4
004 Sudoku.mp4
003 Permutations.mp4
002 Subsets.mp4
21 Trie Data Structure
001 Trie Data Structure.en.srt
005 Trie Queries.en.srt
003 Trie Insertion.en.srt
001 Trie Data Structure.mp4
004 Trie Searching.en.srt
002 Trie Class.en.srt
005 Trie Queries.mp4
002 Trie Class.mp4
003 Trie Insertion.mp4
004 Trie Searching.mp4
05 2D Arrays
007 Mango Trees.en.srt
004 Spiral Print.en.srt
002 2D Array Basics.en.srt
001 Introduction to 2D Arrays.en.srt
005 Sorted Array Search.en.srt
006 Sorted Array Search Code.en.srt
003 2D Character Arrays.en.srt
007 Mango Trees.mp4
004 Spiral Print.mp4
002 2D Array Basics.mp4
001 Introduction to 2D Arrays.mp4
005 Sorted Array Search.mp4
003 2D Character Arrays.mp4
006 Sorted Array Search Code.mp4
20 Hashing
003 Collision Handling.en.srt
010 Hashing Code - VI (Operator [] Overloading).en.srt
006 Hashing Code - III (Rehashing).en.srt
005 Hashing Code - II (Insertion).en.srt
002 Hash Functions.en.srt
003 Collision Handling.mp4
004 Hashing Code - I (Setup).en.srt
001 Introduction to Hashing.en.srt
008 Hashing Code - IV (Search).en.srt
007 Testing our Hashtable.en.srt
009 Hashing Code - V (Erase).en.srt
010 Hashing Code - VI (Operator [] Overloading).mp4
006 Hashing Code - III (Rehashing).mp4
001 Introduction to Hashing.mp4
002 Hash Functions.mp4
005 Hashing Code - II (Insertion).mp4
004 Hashing Code - I (Setup).mp4
007 Testing our Hashtable.mp4
008 Hashing Code - IV (Search).mp4
009 Hashing Code - V (Erase).mp4
01 Introduction
004 New Updates!.html
001 Course Orientation!.en.srt
002 Get maximum out of this course_.en.srt
003 TA Hours_ Doubt Support.html
001 Course Orientation!.mp4
002 Get maximum out of this course_.mp4
15 Stacks
008 Stock Span Solution.en.srt
003 Stack using Linked List.en.srt
006 Stack Insert At Bottom Challenge!.en.srt
001 Stack Data Structure.en.srt
007 Recursively Reverse a Stack.en.srt
002 Stack Implementations.en.srt
004 Stack using Vector.en.srt
005 Stack STL.en.srt
006 Stack Insert At Bottom Challenge!.mp4
008 Stock Span Solution.mp4
003 Stack using Linked List.mp4
007 Recursively Reverse a Stack.mp4
001 Stack Data Structure.mp4
002 Stack Implementations.mp4
005 Stack STL.mp4
004 Stack using Vector.mp4
22 Graphs Introduction
013 Dijkshtra's Algorithm Code.en.srt
001 Graphs Introduction.en.srt
012 Dijkshtra's Algorithm.en.srt
004 Adjacency List Representation with Node Class.en.srt
003 Adjacency List Representation.en.srt
005 BFS.en.srt
006 BFS Code.en.srt
002 Graph Applications.en.srt
011 Topological Ordering using BFS Code.en.srt
008 DFS Code.en.srt
010 Kahn's Algorithm (Modified BFS).en.srt
009 Topological Ordering.en.srt
007 DFS.en.srt
001 Graphs Introduction.mp4
002 Graph Applications.mp4
013 Dijkshtra's Algorithm Code.mp4
012 Dijkshtra's Algorithm.mp4
006 BFS Code.mp4
004 Adjacency List Representation with Node Class.mp4
005 BFS.mp4
009 Topological Ordering.mp4
003 Adjacency List Representation.mp4
010 Kahn's Algorithm (Modified BFS).mp4
008 DFS Code.mp4
007 DFS.mp4
011 Topological Ordering using BFS Code.mp4
04 Character Arrays_Strings
002 Using cin.get().en.srt
007 Solution _ Largest String.en.srt
008 Note _ String Class.html
001 Character Arrays Introduction.en.srt
005 Shortest Path.en.srt
010 Run Length Encoding.en.srt
009 String Class.en.srt
004 Using cin.getline().en.srt
003 Digits & Spaces.en.srt
006 String Copy, Compare, Concat!.en.srt
002 Using cin.get().mp4
007 Solution _ Largest String.mp4
005 Shortest Path.mp4
001 Character Arrays Introduction.mp4
009 String Class.mp4
004 Using cin.getline().mp4
006 String Copy, Compare, Concat!.mp4
010 Run Length Encoding.mp4
003 Digits & Spaces.mp4
09 Recursion Basics
003 Fibonacci Series.en.srt
001 Recursion Introduction.en.srt
004 Sorted Array Check!.en.srt
012 Bubble Sort.en.srt
002 Factorial.en.srt
005 Understanding Recursion Directions.en.srt
013 Number Spell.en.srt
007 First Occurence Code.en.srt
006 First Occurence.en.srt
008 Last Occurence.en.srt
011 Power Function Optimised.en.srt
009 Last Occurence Code.en.srt
010 Power Function.en.srt
003 Fibonacci Series.mp4
001 Recursion Introduction.mp4
004 Sorted Array Check!.mp4
012 Bubble Sort.mp4
002 Factorial.mp4
005 Understanding Recursion Directions.mp4
013 Number Spell.mp4
007 First Occurence Code.mp4
011 Power Function Optimised.mp4
010 Power Function.mp4
006 First Occurence.mp4
008 Last Occurence.mp4
009 Last Occurence Code.mp4
10 Divide & Conquer
002 Merge Sort Code.en.srt
003 Quick Sort.en.srt
005 Rotate Array Search.en.srt
004 Quick Sort Code.en.srt
006 Rotated Search Code.en.srt
001 Merge Sort.en.srt
003 Quick Sort.mp4
002 Merge Sort Code.mp4
005 Rotate Array Search.mp4
001 Merge Sort.mp4
006 Rotated Search Code.mp4
004 Quick Sort Code.mp4
13 Object Oriented Programming
007 Shallow & Deep Copy.en.srt
006 Copy Constructor.en.srt
001 Introduction to OOPS.en.srt
005 Constructor _ Object Initialiastion.en.srt
002 OOPS - Classes & Objects.en.srt
008 Copy Assignment Operator.en.srt
003 Code Demo.en.srt
009 Destructor.en.srt
004 Getters & Setters.en.srt
007 Shallow & Deep Copy.mp4
006 Copy Constructor.mp4
001 Introduction to OOPS.mp4
005 Constructor _ Object Initialiastion.mp4
002 OOPS - Classes & Objects.mp4
008 Copy Assignment Operator.mp4
004 Getters & Setters.mp4
003 Code Demo.mp4
009 Destructor.mp4
06 Pointers & Dynamic Memory
007 Dynamic Memory Allocation.en.srt
009 2D Dynamic Array.en.srt
002 Pointers.en.srt
005 Pass by Reference - Reference Variable.en.srt
003 Dereference Operator.en.srt
001 Address of Operator.en.srt
006 Pass by Reference - Pointers.en.srt
004 Reference Variables.en.srt
008 Using New & Delete.en.srt
007 Dynamic Memory Allocation.mp4
009 2D Dynamic Array.mp4
002 Pointers.mp4
005 Pass by Reference - Reference Variable.mp4
001 Address of Operator.mp4
006 Pass by Reference - Pointers.mp4
004 Reference Variables.mp4
008 Using New & Delete.mp4
003 Dereference Operator.mp4
17 Binary Tree
013 Diameter Code-II.en.srt
006 Level Order Print.en.srt
011 Tree Diameter.en.srt
002 Build Tree Preorder.en.srt
003 Preorder Traversal.en.srt
001 Binary Tree Introduction.en.srt
008 Level Order Build.en.srt
007 Level Order Print Code.en.srt
009 Level Order Build Code.en.srt
005 Postorder Traversal.en.srt
010 Height of Tree.en.srt
004 Inorder Traversal.en.srt
012 Diameter Code-I.en.srt
011 Tree Diameter.mp4
013 Diameter Code-II.mp4
006 Level Order Print.mp4
002 Build Tree Preorder.mp4
003 Preorder Traversal.mp4
001 Binary Tree Introduction.mp4
008 Level Order Build.mp4
005 Postorder Traversal.mp4
007 Level Order Print Code.mp4
010 Height of Tree.mp4
004 Inorder Traversal.mp4
012 Diameter Code-I.mp4
009 Level Order Build Code.mp4
16 Queues
003 Queue using Circular Array.en.srt
006 Stack using 2 Queues Code.en.srt
002 Queue Implementation.en.srt
001 Queue Introduction.en.srt
005 Stack using 2 Queues.en.srt
004 Queue STL.en.srt
003 Queue using Circular Array.mp4
002 Queue Implementation.mp4
006 Stack using 2 Queues Code.mp4
001 Queue Introduction.mp4
005 Stack using 2 Queues.mp4
004 Queue STL.mp4
08 Bit Manipulation
001 Bitwise Operators.en.srt
012 Two Power.en.srt
015 Fast Exponentiation.en.srt
010 Clear Range of Bits.en.srt
011 Replace Bits.en.srt
002 Left Shift & Right Shift.en.srt
007 Update ith Bit.en.srt
013 Count Bits.en.srt
016 Make it Binary!.en.srt
004 Get ith Bit.en.srt
014 Count Bits - Hack.en.srt
009 Clear Last i Bits.en.srt
008 Make Binary.en.srt
003 Odd Even.en.srt
005 Clear ith Bit.en.srt
006 Set ith Bit.en.srt
001 Bitwise Operators.mp4
015 Fast Exponentiation.mp4
010 Clear Range of Bits.mp4
011 Replace Bits.mp4
007 Update ith Bit.mp4
009 Clear Last i Bits.mp4
008 Make Binary.mp4
004 Get ith Bit.mp4
013 Count Bits.mp4
016 Make it Binary!.mp4
002 Left Shift & Right Shift.mp4
014 Count Bits - Hack.mp4
012 Two Power.mp4
005 Clear ith Bit.mp4
003 Odd Even.mp4
006 Set ith Bit.mp4
19 Heaps _ Priority Queue
008 Remove Min_ Max Code.en.srt
011 Nearby Cars Code.en.srt
004 Heaps as Array.en.srt
010 Nearby Cars.en.srt
001 Introduction to Heap.en.srt
007 Remove Min_ Max.en.srt
005 Insertion.en.srt
006 Insertion Code.en.srt
002 Heap vs other Data Structure.en.srt
003 Heaps as CBT.en.srt
009 Priority Queue STL.en.srt
008 Remove Min_ Max Code.mp4
004 Heaps as Array.mp4
007 Remove Min_ Max.mp4
001 Introduction to Heap.mp4
005 Insertion.mp4
006 Insertion Code.mp4
011 Nearby Cars Code.mp4
002 Heap vs other Data Structure.mp4
009 Priority Queue STL.mp4
003 Heaps as CBT.mp4
010 Nearby Cars.mp4
03 Basic Sorting Algorithms
001 Sorting Introduction.en.srt
002 Bubble Sort.en.srt
008 Inbuilt Sort & Comparators.en.srt
011 Online IDE.html
010 Counting Sort Code.en.srt
007 Selection Sort Code.en.srt
005 Insertion Sort Code.en.srt
004 Insertion Sort.en.srt
009 Counting Sort.en.srt
003 Bubble Sort Code.en.srt
006 Selection Sort.en.srt
008 Inbuilt Sort & Comparators.mp4
002 Bubble Sort.mp4
010 Counting Sort Code.mp4
009 Counting Sort.mp4
004 Insertion Sort.mp4
007 Selection Sort Code.mp4
003 Bubble Sort Code.mp4
005 Insertion Sort Code.mp4
006 Selection Sort.mp4
001 Sorting Introduction.mp4
18 Binary Search Tree
006 Deletion Code.en.srt
001 BST Introduction.en.srt
008 Root To Leaf Paths.en.srt
002 BST Creation.en.srt
005 Deletion Concept.en.srt
004 Searching.en.srt
007 Challenge - Print in Range.en.srt
003 Note!.html
001 BST Introduction.mp4
008 Root To Leaf Paths.mp4
006 Deletion Code.mp4
005 Deletion Concept.mp4
007 Challenge - Print in Range.mp4
004 Searching.mp4
002 BST Creation.mp4
12 Space & Time Complexity Analysis
009 Time Complexity For Recursive Problems.en.srt
002 Experimental Analysis.en.srt
001 Space Time Complexity Introduction.en.srt
007 Analysis of Binary Search.en.srt
008 Merge Sort Analysis.en.srt
003 Big O Notation.en.srt
006 Analysis of Bubble Sort.en.srt
004 Nested Loops.en.srt
005 Loops Example.en.srt
002 Experimental Analysis.mp4
001 Space Time Complexity Introduction.mp4
009 Time Complexity For Recursive Problems.mp4
007 Analysis of Binary Search.mp4
008 Merge Sort Analysis.mp4
003 Big O Notation.mp4
006 Analysis of Bubble Sort.mp4
005 Loops Example.mp4
004 Nested Loops.mp4
07 Vector Data Structure
007 Vector Class - III.en.srt
005 Vector Class - I.en.srt
009 Inbuilt Searching.en.srt
008 Header Files & Template Classes.en.srt
006 Vector Class - II.en.srt
002 Vectors - How they grow_.en.srt
001 Vector.en.srt
003 Using Vector Container.en.srt
010 Sorting a Complex Vector!.en.srt
004 2D Vector using STL.en.srt
007 Vector Class - III.mp4
009 Inbuilt Searching.mp4
001 Vector.mp4
002 Vectors - How they grow_.mp4
005 Vector Class - I.mp4
008 Header Files & Template Classes.mp4
006 Vector Class - II.mp4
003 Using Vector Container.mp4
010 Sorting a Complex Vector!.mp4
004 2D Vector using STL.mp4
02 Arrays
001 Array Introduction.en.srt
003 Arrays & Functions - Pass by Reference.en.srt
005 Binary Search.en.srt
011 Subarray Sum - II (Prefix Sums).en.srt
012 Subarray Sum - III (Kadane's Algorithm).en.srt
006 Binary Search Code.en.srt
002 Arrays - Input, Ouput, Update.en.srt
008 Printing Pairs.en.srt
009 Printing Subarrays.en.srt
004 Linear Search.en.srt
007 Array Reverse.en.srt
010 Subarray Sum - I (Brute Force).en.srt
005 Binary Search.mp4
011 Subarray Sum - II (Prefix Sums).mp4
001 Array Introduction.mp4
003 Arrays & Functions - Pass by Reference.mp4
006 Binary Search Code.mp4
012 Subarray Sum - III (Kadane's Algorithm).mp4
004 Linear Search.mp4
008 Printing Pairs.mp4
009 Printing Subarrays.mp4
002 Arrays - Input, Ouput, Update.mp4
007 Array Reverse.mp4
010 Subarray Sum - I (Brute Force).mp4
14 Linked List
001 Linked List Introduction.en.srt
002 Push Front.en.srt
011 Reverse a Linked List Code.en.srt
004 Print.en.srt
009 Pop Front.en.srt
006 Search.en.srt
008 Deletion.en.srt
010 Reverse a Linked List.en.srt
007 Recursive Search.en.srt
005 Insert.en.srt
003 Push Back.en.srt
001 Linked List Introduction.mp4
002 Push Front.mp4
004 Print.mp4
009 Pop Front.mp4
008 Deletion.mp4
010 Reverse a Linked List.mp4
005 Insert.mp4
007 Recursive Search.mp4
011 Reverse a Linked List Code.mp4
006 Search.mp4
003 Push Back.mp4
24 Command Line App - Shopping Cart Backend
001 Shopping Cart Introduction.en.srt
002 Coming Soon!.html
001 Shopping Cart Introduction.mp4
TutsNode.com.txt
.pad
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
[TGx]Downloaded from torrentgalaxy.to .txt
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch Data Structures & Algorithms Essentials (2021) Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
