Other
Java Data Structures and Algorithms Masterclass
-
-
- Rate this torrent + | -
Download Anonymously! Get Protected Today And Get your 70% discount
Torrent info
Torrent Files List
[TutsNode.com] - Java Data Structures and Algorithms Masterclass (Size: 11.55 GB) (Files: 1175)
[TutsNode.com] - Java Data Structures and Algorithms Masterclass
19 Tree _ Binary Tree
015 Delete a Node in Binary Tree (Linked List).mp4
015 Delete a Node in Binary Tree (Linked List).en.srt
014 Insert Method in Binary Tree (Linked List).en.srt
009 PreOrder Traversal in Binary Tree using Linked List.en.srt
013 Search Method in Binary Tree (Linked List).en.srt
012 LevelOrder Traversal in Binary Tree using Linked List.en.srt
004 Creating a Basic Tree in Java.en.srt
010 InOrder Traversal in Binary Tree using Linked List.en.srt
018 Insert Method Binary Tree (Array).en.srt
019 PreOrder Traversal Binary Tree (Array).en.srt
007 Binary Tree Representation.en.srt
011 PostOrder Traversal in Binary Tree using Linked List.en.srt
023 Search Method Binary Tree (Array).en.srt
017 Create Binary Tree (Array).en.srt
001 What is a Tree_.en.srt
024 Delete a Node Binary Tree (Array).en.srt
020 InOrder Traversal Binary Tree (Array).en.srt
026 Array vs Linked List in Binary Tree Implementation.en.srt
022 levelOrder Traversal Binary Tree (Array).en.srt
008 Create Binary Tree using Linked List.en.srt
021 PostOrder Traversal Binary Tree (Array).en.srt
003 Tree Terminology.en.srt
006 Types of Binary Tree.en.srt
025 Delete Binary Tree (Array).en.srt
005 What is A Binary Tree_.en.srt
016 Delet Entire Binary Tree (Linked List).en.srt
199 BinaryTreeLL.java
002 Why Tree_.en.srt
027 Download Resources.html
199 BinaryNode.java
199 BinaryTree.java
199 TreeNode.java
014 Insert Method in Binary Tree (Linked List).mp4
009 PreOrder Traversal in Binary Tree using Linked List.mp4
013 Search Method in Binary Tree (Linked List).mp4
010 InOrder Traversal in Binary Tree using Linked List.mp4
018 Insert Method Binary Tree (Array).mp4
012 LevelOrder Traversal in Binary Tree using Linked List.mp4
019 PreOrder Traversal Binary Tree (Array).mp4
004 Creating a Basic Tree in Java.mp4
023 Search Method Binary Tree (Array).mp4
020 InOrder Traversal Binary Tree (Array).mp4
024 Delete a Node Binary Tree (Array).mp4
022 levelOrder Traversal Binary Tree (Array).mp4
011 PostOrder Traversal in Binary Tree using Linked List.mp4
021 PostOrder Traversal Binary Tree (Array).mp4
017 Create Binary Tree (Array).mp4
026 Array vs Linked List in Binary Tree Implementation.mp4
001 What is a Tree_.mp4
007 Binary Tree Representation.mp4
008 Create Binary Tree using Linked List.mp4
003 Tree Terminology.mp4
025 Delete Binary Tree (Array).mp4
016 Delet Entire Binary Tree (Linked List).mp4
006 Types of Binary Tree.mp4
005 What is A Binary Tree_.mp4
002 Why Tree_.mp4
18 Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)
008 Solution - Animal Shelter.en.srt
002 Solution - Three in One.en.srt
004 Solution Part 1 - Stack of Plates.en.srt
008 Solution - Animal Shelter.mp4
003 Solution - Stack Minimum.en.srt
007 Solution - Queue via Stacks.en.srt
005 Solution Part 2 - Stack of Plates.en.srt
006 Solution Part 3 - Follow UP.en.srt
001 Goals.en.srt
009 Download Resources.html
165 ThreeInOne.java
166 Node.java
166 StackMin.java
172 Node.java
172 StackMin.java
172 ThreeInOne.java
002 Solution - Three in One.mp4
004 Solution Part 1 - Stack of Plates.mp4
003 Solution - Stack Minimum.mp4
005 Solution Part 2 - Stack of Plates.mp4
007 Solution - Queue via Stacks.mp4
006 Solution Part 3 - Follow UP.mp4
001 Goals.mp4
25 Sorting Algorithms
009 Quick Sort.en.srt
007 Bucket Sort.en.srt
010 Heap Sort.en.srt
004 Bubble Sort.en.srt
008 Merge Sort.en.srt
006 Insertion Sort.en.srt
005 Selection Sort.en.srt
002 Types of Sorting.en.srt
003 Sorting Terminology.en.srt
001 What is Sorting_.en.srt
267 BinaryHeap.java
011 Comparison of Sorting Algorithms.en.srt
267 BucketSort.java
012 Download Resources.html
267 MergeSort.java
267 QuickSort.java
267 SelectionSort.java
267 BubbleSort.java
267 HeapSort.java
267 InsertionSort.java
007 Bucket Sort.mp4
009 Quick Sort.mp4
010 Heap Sort.mp4
008 Merge Sort.mp4
004 Bubble Sort.mp4
006 Insertion Sort.mp4
005 Selection Sort.mp4
002 Types of Sorting.mp4
003 Sorting Terminology.mp4
001 What is Sorting_.mp4
011 Comparison of Sorting Algorithms.mp4
21 AVL Tree
009 Insert a Node in AVL (Method in Practice).en.srt
008 Insert a Node in AVL (All Together).en.srt
009 Insert a Node in AVL (Method in Practice).mp4
012 Delete a Node from AVL (Method in practice).en.srt
004 Insert a Node in AVL (Left Left Condition).en.srt
003 Common Operations on AVL Tree.en.srt
006 Insert a Node in AVL (Right Right Condition).en.srt
010 Delete a Node from AVL (LL, LR, RR, RR).en.srt
005 Insert a Node in AVL (Left Right Condition).en.srt
001 What is an AVL Tree_.en.srt
011 Delete a Node from ALL (All Together).en.srt
007 Insert a Node in AVL (Right Left Condition).en.srt
002 Why Do We Need AVL Tree_.en.srt
227 AVL.java
014 Time and Space Complexity of AVL.en.srt
015 Binary Search Tree vs AVL.en.srt
013 Delete Entire AVL Tree.en.srt
016 Download Resources.html
227 BinaryNode.java
012 Delete a Node from AVL (Method in practice).mp4
003 Common Operations on AVL Tree.mp4
008 Insert a Node in AVL (All Together).mp4
004 Insert a Node in AVL (Left Left Condition).mp4
010 Delete a Node from AVL (LL, LR, RR, RR).mp4
005 Insert a Node in AVL (Left Right Condition).mp4
011 Delete a Node from ALL (All Together).mp4
006 Insert a Node in AVL (Right Right Condition).mp4
001 What is an AVL Tree_.mp4
007 Insert a Node in AVL (Right Left Condition).mp4
002 Why Do We Need AVL Tree_.mp4
013 Delete Entire AVL Tree.mp4
014 Time and Space Complexity of AVL.mp4
015 Binary Search Tree vs AVL.mp4
22 Binary Heap
004 Extract a Node from Binary Heap.en.srt
002 Common Operations on Binary Heap.en.srt
003 Insert a Node in Binary Heap.en.srt
001 What is Binary Heap_ Why do we need Binary Heap_.en.srt
006 Time and Space Complexity of Binary Heap.en.srt
005 Delete Entire Binary Heap.en.srt
234 BinaryHeap.java
007 Download Resources.html
004 Extract a Node from Binary Heap.mp4
002 Common Operations on Binary Heap.mp4
003 Insert a Node in Binary Heap.mp4
001 What is Binary Heap_ Why do we need Binary Heap_.mp4
006 Time and Space Complexity of Binary Heap.mp4
005 Delete Entire Binary Heap.mp4
17 Queue
008 Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array.en.srt
003 Create, isFull, isEmpty and enQueue methods using Linear Queue Array.en.srt
009 Dequeue, Peek and Delete Methods in Circular Queue using Array.en.srt
004 Dequeue, Peek and Delete Methods using Linear Queue Array.en.srt
013 Dequeue, Peek and Delete Methods in Queue using Linked List.en.srt
012 Create, Enqueue and isEmpty Methods in Queue using Linked List.en.srt
008 Create, Enqueue, isFull and isEmpty Methods in Circular Queue using Array.mp4
007 Circular Queue Operations using Array.en.srt
011 Queue Operations using Linked List.en.srt
002 Linear Queue Operations using Array.en.srt
001 What is a Queue_.en.srt
006 Why Circular Queue_.en.srt
010 Time and Space Complexity of Circular Queue using Array.en.srt
005 Time and Space Complexity of Linear Queue using Array.en.srt
017 Download Resources.html
163 CircularQueue.java
163 LinkedList.java
163 Node.java
163 QueueArray.java
163 QueueLinkedList.java
014 Time and Space Complexity of Queue using Linked List.en.srt
015 Array vs Linked List Implementation.en.srt
016 When to Use_Avoid Queue_.en.srt
003 Create, isFull, isEmpty and enQueue methods using Linear Queue Array.mp4
009 Dequeue, Peek and Delete Methods in Circular Queue using Array.mp4
004 Dequeue, Peek and Delete Methods using Linear Queue Array.mp4
013 Dequeue, Peek and Delete Methods in Queue using Linked List.mp4
012 Create, Enqueue and isEmpty Methods in Queue using Linked List.mp4
001 What is a Queue_.mp4
011 Queue Operations using Linked List.mp4
007 Circular Queue Operations using Array.mp4
002 Linear Queue Operations using Array.mp4
006 Why Circular Queue_.mp4
010 Time and Space Complexity of Circular Queue using Array.mp4
005 Time and Space Complexity of Linear Queue using Array.mp4
014 Time and Space Complexity of Queue using Linked List.mp4
015 Array vs Linked List Implementation.mp4
016 When to Use_Avoid Queue_.mp4
20 Binary Search Tree
009 Delete a Node in Binary Search Tree.en.srt
003 Insert a Node to Binary Search Tree.en.srt
008 Search in Binary Search Tree.en.srt
007 Level Order Traversal Binary Search Tree.en.srt
004 PreOrder Traversal Binary Search Tree.en.srt
002 Create Binary Search Tree.en.srt
005 InOrder Traversal Binary Search Tree.en.srt
006 PostOrder Traversal Binary Search Tree.en.srt
011 Time and Space Complexity of BST.en.srt
001 What is a Binary Search Tree_ Why do we need it_.en.srt
010 Delete BST.en.srt
211 BinarySearchTree.java
012 Download Resources.html
009 Delete a Node in Binary Search Tree.mp4
003 Insert a Node to Binary Search Tree.mp4
008 Search in Binary Search Tree.mp4
004 PreOrder Traversal Binary Search Tree.mp4
007 Level Order Traversal Binary Search Tree.mp4
005 InOrder Traversal Binary Search Tree.mp4
006 PostOrder Traversal Binary Search Tree.mp4
002 Create Binary Search Tree.mp4
011 Time and Space Complexity of BST.mp4
010 Delete BST.mp4
001 What is a Binary Search Tree_ Why do we need it_.mp4
16 Stack
008 Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List.en.srt
005 Stack Operations using Array (Push, Pop, Peek, Delete).en.srt
146 MainStackLinkedList.java
004 Stack Operations using Array (Create, isEmpty, isFull).en.srt
007 Stack Operations using Linked List.en.srt
002 Stack Operations.en.srt
001 What and Why of Stack_.en.srt
003 Stack using Array vs Linked List.en.srt
011 Download Resources.html
146 LinkedList.java
146 Node.java
146 StackArray.java
146 StackLinkedList.java
009 Time and Space Complexity of Stack using Linked List.en.srt
006 Time and Space Complexity of Stack using Array.en.srt
010 When to Use_Avoid Stack.en.srt
008 Stack methods - Push , Pop, Peek, Delete and isEmpty using Linked List.mp4
005 Stack Operations using Array (Push, Pop, Peek, Delete).mp4
004 Stack Operations using Array (Create, isEmpty, isFull).mp4
007 Stack Operations using Linked List.mp4
001 What and Why of Stack_.mp4
002 Stack Operations.mp4
009 Time and Space Complexity of Stack using Linked List.mp4
006 Time and Space Complexity of Stack using Array.mp4
010 When to Use_Avoid Stack.mp4
003 Stack using Array vs Linked List.mp4
01 Introduction
007 Motivation.html
001 Curriculum Walkthrough.en.srt
006 Types of Algorithms.en.srt
003 What is an algorithm_.en.srt
004 Why are Data Structures and Algorithms important_.en.srt
002 What is a data structure_.en.srt
005 Types of Data Structures.en.srt
001 Curriculum Walkthrough.mp4
002 What is a data structure_.mp4
004 Why are Data Structures and Algorithms important_.mp4
003 What is an algorithm_.mp4
006 Types of Algorithms.mp4
005 Types of Data Structures.mp4
02 Recursion
001 Goals _ what you will learn by the end of this section.en.srt
009 Download the Resources.html
016 RecrusionFibonacci.java
016 Recursion.java
007 How to Write Recursion in 3 Steps_.en.srt
004 The Logic Behind Recursion.en.srt
008 Fibonacci Series using Recursion.en.srt
006 When to Use_Avoid Recursion_.en.srt
002 What is Recursion_.en.srt
005 Recursive vs Iterative Solution.en.srt
003 Why do we need Recursion_.en.srt
007 How to Write Recursion in 3 Steps_.mp4
008 Fibonacci Series using Recursion.mp4
002 What is Recursion_.mp4
004 The Logic Behind Recursion.mp4
006 When to Use_Avoid Recursion_.mp4
005 Recursive vs Iterative Solution.mp4
003 Why do we need Recursion_.mp4
001 Goals _ what you will learn by the end of this section.mp4
24 Hashing
004 Types of Collision Resolution Techniques - Direct Chaining (Insert).en.srt
007 Collision Resolution Technique - Linear Probing (Insert).en.srt
010 Collision Resolution Technique - Open Addressing _ Double Hashing.en.srt
009 Collision Resolution Technique - Open Addressing _ Quadratic Probing.en.srt
003 Hash Functions.en.srt
008 Collision Resolution Technique - Linear Probing (Search, Delete).en.srt
005 Direct Chaining Implementation - (Search, Delete).en.srt
001 What is Hashing_ Why we need it_.en.srt
011 Pros and Cons of Resolution Techniques.en.srt
006 Hash Table is Full.en.srt
002 Hashing Terminology.en.srt
012 Practical Use of Hashing.en.srt
013 Hashing vs Other DS.en.srt
255 Hashing-Quadratic-Probing.zip
255 Hashing-Linear-Probing.zip
255 DoubleHashing.zip
255 Hashing-DirectChaining.zip
014 Download Resources.html
007 Collision Resolution Technique - Linear Probing (Insert).mp4
004 Types of Collision Resolution Techniques - Direct Chaining (Insert).mp4
010 Collision Resolution Technique - Open Addressing _ Double Hashing.mp4
008 Collision Resolution Technique - Linear Probing (Search, Delete).mp4
009 Collision Resolution Technique - Open Addressing _ Quadratic Probing.mp4
005 Direct Chaining Implementation - (Search, Delete).mp4
003 Hash Functions.mp4
002 Hashing Terminology.mp4
012 Practical Use of Hashing.mp4
001 What is Hashing_ Why we need it_.mp4
011 Pros and Cons of Resolution Techniques.mp4
006 Hash Table is Full.mp4
013 Hashing vs Other DS.mp4
38 Greedy Algorithms
004 Activity Selection Problem in Java.en.srt
008 Fractional Knapsack Problem in Java.en.srt
006 Coin Change Problem in Java.en.srt
002 Known Greedy Algorithms.en.srt
001 What is Greedy Algorithm_.en.srt
003 Activity Selection Problem.en.srt
007 Fractional Knapsack Problem.en.srt
005 Coin Change Problem.en.srt
346 FractionalKnapsack.java
009 Download Resources.html
346 KnapsackItem.java
346 ActivitySelection.java
346 Activity.java
346 CoinChangeProblem.java
004 Activity Selection Problem in Java.mp4
008 Fractional Knapsack Problem in Java.mp4
006 Coin Change Problem in Java.mp4
001 What is Greedy Algorithm_.mp4
002 Known Greedy Algorithms.mp4
007 Fractional Knapsack Problem.mp4
003 Activity Selection Problem.mp4
005 Coin Change Problem.mp4
23 Trie
005 Delete a String from Trie.en.srt
003 Insert a String in Trie.en.srt
004 Search for a String in Trie.en.srt
001 What is a Trie_ Why we need Trie_.en.srt
002 Common Operations on a Trie (Creation).en.srt
006 Practical Uses of Trie.en.srt
241 Trie.java
007 Download Resources.html
241 TrieNode.java
005 Delete a String from Trie.mp4
004 Search for a String in Trie.mp4
003 Insert a String in Trie.mp4
001 What is a Trie_ Why we need Trie_.mp4
002 Common Operations on a Trie (Creation).mp4
006 Practical Uses of Trie.mp4
11 Linked List
012 Deletion Method in Singly Linked List.en.srt
008 Insertion Method in Singly Linked List.en.srt
003 Types of Linked List.en.srt
005 Creation of Singly Linked List.en.srt
009 Traversal of Singly Linked List.en.srt
010 Searching in Singly Linked List.en.srt
011 Deletion of a Node from Singly Linked List.en.srt
015 Download Resources.html
089 MainSinglyLinkedList.java
089 Node.java
089 SinglyLinkedList.java
007 Insertion Algorithm in Singly Linked List.en.srt
013 Deletion of Entire Singly Linked List.en.srt
001 What is a Linked List_.en.srt
014 Time and Space Complexity of Singly Linked List.en.srt
004 Linked List in the Memory.en.srt
002 Linked List vs Array.en.srt
006 Insertion in Singly Linked List in Memory.en.srt
012 Deletion Method in Singly Linked List.mp4
008 Insertion Method in Singly Linked List.mp4
009 Traversal of Singly Linked List.mp4
003 Types of Linked List.mp4
010 Searching in Singly Linked List.mp4
011 Deletion of a Node from Singly Linked List.mp4
005 Creation of Singly Linked List.mp4
007 Insertion Algorithm in Singly Linked List.mp4
001 What is a Linked List_.mp4
013 Deletion of Entire Singly Linked List.mp4
014 Time and Space Complexity of Singly Linked List.mp4
006 Insertion in Singly Linked List in Memory.mp4
002 Linked List vs Array.mp4
004 Linked List in the Memory.mp4
36 Kruskal and Prim's Algorithms
002 Kruskal Algorithm in Java.en.srt
001 Kruskal Algorithm.en.srt
004 Prim's Algorithm in Java.en.srt
003 Prim's Algorithm.en.srt
005 Kruskal vs Prim's Algorithms.en.srt
335 Prims.java
335 Kruskal.java
006 Download Resources.html
002 Kruskal Algorithm in Java.mp4
004 Prim's Algorithm in Java.mp4
003 Prim's Algorithm.mp4
001 Kruskal Algorithm.mp4
005 Kruskal vs Prim's Algorithms.mp4
06 Cracking Big O Interview Questions
003 Question 3 - Time Complexity of Print Unordered Pairs Method.en.srt
005 Question 5 - Find Time Complexity for Given Method.en.srt
002 Question 2 - Time Complexity of Print Pairs Method.en.srt
006 Question 6 - Time Complexity of Reverse Array Function.en.srt
001 Question 1 - Time Complexity of Method that returns Sum and Product of Array.en.srt
007 Question 7 - Equivalent to O(N).en.srt
010 Question 10 - Time Complexity Powers Of 2.en.srt
009 Question 9 - Time Complexity of Fibonacci.en.srt
008 Question 8 - Time Complexity of Factorial.en.srt
004 Question 4 - Find Time Complexity for Given Method.en.srt
001 Question 1 - Time Complexity of Method that returns Sum and Product of Array.mp4
006 Question 6 - Time Complexity of Reverse Array Function.mp4
002 Question 2 - Time Complexity of Print Pairs Method.mp4
003 Question 3 - Time Complexity of Print Unordered Pairs Method.mp4
007 Question 7 - Equivalent to O(N).mp4
010 Question 10 - Time Complexity Powers Of 2.mp4
008 Question 8 - Time Complexity of Factorial.mp4
009 Question 9 - Time Complexity of Fibonacci.mp4
004 Question 4 - Find Time Complexity for Given Method.mp4
005 Question 5 - Find Time Complexity for Given Method.mp4
09 Cracking Array Interview Questions (Amazon, Facebook, Apple and Microsoft)
001 Section Goals.mp4
008 Rotate Matrix _ Image - LeetCode 48.en.srt
001 Section Goals.en.srt
003 Solution - Pairs.en.srt
009 Download Resources.html
074 findanumber.java
074 isunique.java
074 maxProduct.java
074 missingNumber.java
074 permutation.java
074 rotateMatrix.java
074 twosum.java
007 Solution - Permutation.en.srt
002 Solution - Missing Number.en.srt
005 Solution - Max Product of Two Integers.en.srt
004 Solution - Finding a Number in an Array.en.srt
006 Solution - IsUnique _ Contains Duplicate - LeetCode 217.en.srt
008 Rotate Matrix _ Image - LeetCode 48.mp4
003 Solution - Pairs.mp4
007 Solution - Permutation.mp4
002 Solution - Missing Number.mp4
005 Solution - Max Product of Two Integers.mp4
006 Solution - IsUnique _ Contains Duplicate - LeetCode 217.mp4
004 Solution - Finding a Number in an Array.mp4
31 Dijkstra's Algorithm
002 Dijkstra's Algorithm in Java - 1.en.srt
003 Dijkstra's Algorithm in Java - 2.en.srt
001 Dijkstra's Algorithm for SSSPP.en.srt
004 Dijkstra's Algorithm with Negative Cycle.en.srt
311 WeightedGraph.java
005 Download Resources.html
311 WeightedNode.java
002 Dijkstra's Algorithm in Java - 1.mp4
003 Dijkstra's Algorithm in Java - 2.mp4
001 Dijkstra's Algorithm for SSSPP.mp4
004 Dijkstra's Algorithm with Negative Cycle.mp4
03 Cracking Recursion Interview Questions
005 Download the Resources.html
021 question1.java
021 Question2.java
021 Question3.java
021 Question4.java
001 Question 1 - Sum of Digits.en.srt
004 Question 4 - Decimal to Binary.en.srt
003 Question 3 - GCD.en.srt
002 Question 2 - Power.en.srt
001 Question 1 - Sum of Digits.mp4
004 Question 4 - Decimal to Binary.mp4
003 Question 3 - GCD.mp4
002 Question 2 - Power.mp4
04 Bonus CHALLENGING Recursion Problems
001 SOLUTIONS PART 1.html
002 SOLUTIONS PART 2.html
13 Doubly Linked List
004 Insertion Method Doubly Linked List.en.srt
001 Create Doubly Linked List.en.srt
010 Deletion Method in Doubly Linked List.en.srt
002 Insertion Doubly Linked List.en.srt
007 Searching for a Node in Doubly Linked List.en.srt
008 Deletion of a Node in Doubly Linked List.en.srt
005 Traversal of Doubly Linked List.en.srt
006 Reverse Traversal of Doubly Linked List.en.srt
011 Delete Entire Doubly Linked List.en.srt
003 Insertion Algorithm Doubly Linked List.en.srt
013 Download Resources.html
114 DoublyNode.java
114 MainDoublyLinkedList.java
009 Deletion Algorithm Doubly Linked List.en.srt
012 Time and Space Complexity of Doubly Linked List.en.srt
114 DoublyLinkedList.java
004 Insertion Method Doubly Linked List.mp4
010 Deletion Method in Doubly Linked List.mp4
001 Create Doubly Linked List.mp4
007 Searching for a Node in Doubly Linked List.mp4
006 Reverse Traversal of Doubly Linked List.mp4
005 Traversal of Doubly Linked List.mp4
011 Delete Entire Doubly Linked List.mp4
002 Insertion Doubly Linked List.mp4
008 Deletion of a Node in Doubly Linked List.mp4
003 Insertion Algorithm Doubly Linked List.mp4
012 Time and Space Complexity of Doubly Linked List.mp4
009 Deletion Algorithm Doubly Linked List.mp4
14 Circular Doubly Linked List
004 Insertion Method Circular Doubly Linked List.en.srt
001 Create Doubly Linked List.en.srt
010 Deletion Method in Circular Doubly Linked List.en.srt
008 Deletion in Circular Doubly Linked List.en.srt
002 Insertion Circular Doubly Linked List.en.srt
007 Search for a Node in Circular Doubly Linked List.en.srt
005 Traversal of Circular Doubly Linked List.en.srt
006 Reverse Traversal of Circular Doubly Linked List.en.srt
011 Delete Entire Circular Doubly Linked List.en.srt
013 Time Complexity of Array vs Linked List.en.srt
003 Insertion Algorithm Circular Doubly Linked List.en.srt
009 Deletion Algorithm in Circular Doubly Linked List.en.srt
014 Download Resources.html
128 DoublyNode.java
128 MainCircularDoublyLinkedList.java
012 Time and Space Complexity of Circular Doubly Linked List.en.srt
128 CircularDoublyLinkedList.java
004 Insertion Method Circular Doubly Linked List.mp4
010 Deletion Method in Circular Doubly Linked List.mp4
001 Create Doubly Linked List.mp4
007 Search for a Node in Circular Doubly Linked List.mp4
008 Deletion in Circular Doubly Linked List.mp4
006 Reverse Traversal of Circular Doubly Linked List.mp4
002 Insertion Circular Doubly Linked List.mp4
005 Traversal of Circular Doubly Linked List.mp4
011 Delete Entire Circular Doubly Linked List.mp4
013 Time Complexity of Array vs Linked List.mp4
003 Insertion Algorithm Circular Doubly Linked List.mp4
009 Deletion Algorithm in Circular Doubly Linked List.mp4
012 Time and Space Complexity of Circular Doubly Linked List.mp4
26 Searching Algorithms
005 Binary Search in Java.en.srt
003 Linear Search in Java.en.srt
006 Time Complexity of Binary Search.en.srt
002 Linear Search.en.srt
004 Binary Search.en.srt
274 Searching.zip
001 Introduction To Search Algorithms.en.srt
007 Download Resources.html
005 Binary Search in Java.mp4
003 Linear Search in Java.mp4
006 Time Complexity of Binary Search.mp4
002 Linear Search.mp4
004 Binary Search.mp4
001 Introduction To Search Algorithms.mp4
12 Circular Singly Linked List
001 Create Circular Singly Linked List.en.srt
004 Insertion Method Circular Singly Linked List.en.srt
009 Deletion Method in Circular Singly Linked List.en.srt
006 Searching a Node in Circular Singly Linked List.en.srt
005 Traversal of Circular Singly Linked List.en.srt
007 Deletion of a Node from Circular Singly List.en.srt
002 Insertion in Circular Singly Linked List.en.srt
012 Download Resources.html
101 CircularSinglyLinkedList.java
101 MainCircularSinglyLinkedList.java
101 Node.java
010 Delete Entire Circular Singly Linked List.en.srt
011 Time and Space Complexity of Circular Singly Linked List.en.srt
008 Deletion Algorithm in Circular Singly Linked List.en.srt
003 Insertion Algorithm in Circular Singly Linked List.en.srt
004 Insertion Method Circular Singly Linked List.mp4
009 Deletion Method in Circular Singly Linked List.mp4
001 Create Circular Singly Linked List.mp4
005 Traversal of Circular Singly Linked List.mp4
006 Searching a Node in Circular Singly Linked List.mp4
007 Deletion of a Node from Circular Singly List.mp4
010 Delete Entire Circular Singly Linked List.mp4
002 Insertion in Circular Singly Linked List.mp4
011 Time and Space Complexity of Circular Singly Linked List.mp4
003 Insertion Algorithm in Circular Singly Linked List.mp4
008 Deletion Algorithm in Circular Singly Linked List.mp4
40 Dynamic Programming
007 Number Factor Problem using Dynamic Programming.en.srt
003 Top Down with Memoization.en.srt
009 House Robber Problem using Dynamic Programming.en.srt
008 Number Factor _ Top Down and Bottom Up.en.srt
004 Bottom Up with Tabulation.en.srt
010 Convert one string to another using Dynamic Programming.en.srt
001 What is Dynamic Programming_ (Overlapping property).en.srt
005 Top Down vs Bottom Up.en.srt
006 Is Merge Sort Dynamic Programming_.en.srt
002 Where Does the Name of DP Come From_.en.srt
003 Top Down with Memoization.mp4
009 House Robber Problem using Dynamic Programming.mp4
007 Number Factor Problem using Dynamic Programming.mp4
004 Bottom Up with Tabulation.mp4
008 Number Factor _ Top Down and Bottom Up.mp4
010 Convert one string to another using Dynamic Programming.mp4
002 Where Does the Name of DP Come From_.mp4
001 What is Dynamic Programming_ (Overlapping property).mp4
006 Is Merge Sort Dynamic Programming_.mp4
005 Top Down vs Bottom Up.mp4
15 Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)
006 Solution - Intersection.en.srt
002 Solution - Remove Dups.en.srt
005 Solution - Sum Lists.en.srt
001 Linked List Class.en.srt
004 Solution - Partition.en.srt
003 Solution - Return Nth to Last.en.srt
007 Download Resources.html
135 LinkedList.java
135 Questions.java
006 Solution - Intersection.mp4
005 Solution - Sum Lists.mp4
002 Solution - Remove Dups.mp4
004 Solution - Partition.mp4
001 Linked List Class.mp4
003 Solution - Return Nth to Last.mp4
27 Graphs
006 Graph in Java using Adjacency Matrix.en.srt
005 Graph Representation.en.srt
007 Graph in Java using Adjacency List.en.srt
004 Types of Graph.en.srt
003 Graph Terminology.en.srt
002 What is a Graph_ Why do we need Graph.en.srt
282 Archive.zip
001 What you will learn.en.srt
008 Download Resources.html
006 Graph in Java using Adjacency Matrix.mp4
007 Graph in Java using Adjacency List.mp4
005 Graph Representation.mp4
002 What is a Graph_ Why do we need Graph.mp4
003 Graph Terminology.mp4
004 Types of Graph.mp4
001 What you will learn.mp4
07 Arrays
005 Insertion in Array.en.srt
011 Create Two Dimensional Array.en.srt
012 Insertion - Two Dimensional Array.en.srt
019 Download Resources.html
061 SingleDimensionArray.java
061 TwoDimensionalArray.java
004 Create an Array.en.srt
015 Searching Two Dimensional Array.en.srt
008 Search for Array Element.en.srt
007 Array Traversal.en.srt
001 What is an Array_.en.srt
014 Traverse Two Dimensional Array.en.srt
013 Accessing Two Dimensional Array Element.en.srt
002 Types of Arrays.en.srt
016 Delete Two Dimensional Array Element.en.srt
009 Delete Array Element.en.srt
006 Accessing Elements in Array.en.srt
010 Time and Space Complexity of 1D Arrays.en.srt
017 Time and Space Complexity of 1D Arrays.en.srt
003 Arrays in Memory.en.srt
018 When to Use_Avoid Arrays.en.srt
012 Insertion - Two Dimensional Array.mp4
005 Insertion in Array.mp4
015 Searching Two Dimensional Array.mp4
011 Create Two Dimensional Array.mp4
008 Search for Array Element.mp4
016 Delete Two Dimensional Array Element.mp4
013 Accessing Two Dimensional Array Element.mp4
007 Array Traversal.mp4
014 Traverse Two Dimensional Array.mp4
004 Create an Array.mp4
009 Delete Array Element.mp4
001 What is an Array_.mp4
002 Types of Arrays.mp4
006 Accessing Elements in Array.mp4
010 Time and Space Complexity of 1D Arrays.mp4
017 Time and Space Complexity of 1D Arrays.mp4
003 Arrays in Memory.mp4
018 When to Use_Avoid Arrays.mp4
34 Floyd Warshall Algorithm
004 Floyd Warshall in Java.en.srt
001 Floyd Warshall Algorithm.en.srt
002 Why Floyd Warshall Algorithm_.en.srt
005 BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall Algorithms.en.srt
003 Floyd Warshall with Negative Cycle.en.srt
325 FloydWarshall.java
006 Download Resources.html
325 WeightedNode.java
004 Floyd Warshall in Java.mp4
001 Floyd Warshall Algorithm.mp4
002 Why Floyd Warshall Algorithm_.mp4
005 BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall Algorithms.mp4
003 Floyd Warshall with Negative Cycle.mp4
28 Graph Traversal - Breadth First Search and Depth First Search Algorithms
002 Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.en.srt
001 Breadth First Search Algorithm (BFS).en.srt
005 Depth First Search (DFS) Algorithm.en.srt
003 Breadth First Search Algorithm (BFS) in Java - Adjacency List.en.srt
006 Depth First Search (DFS) Algorithm in Java - Adjacency List.en.srt
007 Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.en.srt
009 BFS Traversal vs DFS Traversal.en.srt
004 Time Complexity of Breadth First Search (BFS) Algorithm.en.srt
008 Time Complexity of Depth First Search (DFS) Algorithm.en.srt
292 Archive.zip
010 Download Resources.html
002 Breadth First Search Algorithm (BFS) in Java - Adjacency Matrix.mp4
007 Depth First Search (DFS) Algorithm in Java - Adjacency Matrix.mp4
001 Breadth First Search Algorithm (BFS).mp4
003 Breadth First Search Algorithm (BFS) in Java - Adjacency List.mp4
006 Depth First Search (DFS) Algorithm in Java - Adjacency List.mp4
005 Depth First Search (DFS) Algorithm.mp4
009 BFS Traversal vs DFS Traversal.mp4
004 Time Complexity of Breadth First Search (BFS) Algorithm.mp4
008 Time Complexity of Depth First Search (DFS) Algorithm.mp4
42 A Recipe for Problem Solving
006 Step 4 - Solve or Simplify.en.srt
007 Step 5 - Look Back and Refactor.en.srt
005 Step 3 - Break it Down.en.srt
004 Step 2 - Examples.en.srt
003 Step 1 - Understand the Problem.en.srt
002 Introduction.en.srt
001 Important Note!.html
006 Step 4 - Solve or Simplify.mp4
007 Step 5 - Look Back and Refactor.mp4
005 Step 3 - Break it Down.mp4
004 Step 2 - Examples.mp4
003 Step 1 - Understand the Problem.mp4
002 Introduction.mp4
29 Topological Sort
003 Topological Sort using Adjacency List.en.srt
002 Topological Sort Algorithm.en.srt
004 Topological Sort using Adjacency Matrix.en.srt
005 Time and Space Complexity of Topological Sort.en.srt
001 What is Topological Sort_.en.srt
298 TopologicalSort.zip
006 Download Resources.html
003 Topological Sort using Adjacency List.mp4
004 Topological Sort using Adjacency Matrix.mp4
002 Topological Sort Algorithm.mp4
005 Time and Space Complexity of Topological Sort.mp4
001 What is Topological Sort_.mp4
35 Minimum Spanning Tree (Disjoint Set)
003 Disjoint Set in Java.en.srt
329 DisjointSet.java
001 What is Minimum Spanning Tree_.en.srt
002 What is Disjoint Set_.en.srt
004 Download Resources.html
329 WeightedNode.java
003 Disjoint Set in Java.mp4
001 What is Minimum Spanning Tree_.mp4
002 What is Disjoint Set_.mp4
30 Single Source Shortest Path Problem (SSSPP)
003 BFS for SSSPP in Java using Adjacency List.en.srt
004 BFS for SSSPP in Java using Adjacency Matrix.en.srt
002 Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP).en.srt
001 What is Single Source Shortest Path Problem_.en.srt
006 Why does BFS not work with Weighted Graph_.en.srt
005 Time and Space Complexity of BFS for SSSPP.en.srt
306 SSSPP.zip
007 Why does DFS not work for SSSP_.en.srt
008 Download Resources.html
003 BFS for SSSPP in Java using Adjacency List.mp4
004 BFS for SSSPP in Java using Adjacency Matrix.mp4
002 Breadth First Search (BFS) for Single Source Shortest Path Problem (SSSPP).mp4
001 What is Single Source Shortest Path Problem_.mp4
006 Why does BFS not work with Weighted Graph_.mp4
005 Time and Space Complexity of BFS for SSSPP.mp4
007 Why does DFS not work for SSSP_.mp4
32 Bellman Ford Algorithm
001 Bellman Ford Algorithm for SSSPP.en.srt
004 Bellman Ford Algorithm Implementation in Java.en.srt
002 Bellman Ford Algorithm with Negative Cycle.en.srt
003 Why Bellman Ford runs V-1 times_.en.srt
005 BFS vs Dijkstra vs Bellman Ford.en.srt
317 WeightedGraph.java
006 Download Resources.html
317 WeightedNode.java
004 Bellman Ford Algorithm Implementation in Java.mp4
001 Bellman Ford Algorithm for SSSPP.mp4
002 Bellman Ford Algorithm with Negative Cycle.mp4
005 BFS vs Dijkstra vs Bellman Ford.mp4
003 Why Bellman Ford runs V-1 times_.mp4
37 Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)
002 Solution to Route Between Nodes.en.srt
001 Introduction.en.srt
002 Solution to Route Between Nodes.mp4
001 Introduction.mp4
05 Big O Notation
003 Most Common Time Complexities.en.srt
002 Big O Notations (Big O, Big Omega, Big Theta).en.srt
008 How to Measure Recursive Algorithm_.en.srt
007 How to Measure the Code using Big O_.en.srt
009 How to Measure Recursive Algorithm with Multiple Calls_.en.srt
005 Drop Constants and Non Dominant Terms.en.srt
001 What is Big O_.en.srt
004 Space Complexity.en.srt
006 Addition vs Multiplication.en.srt
003 Most Common Time Complexities.mp4
008 How to Measure Recursive Algorithm_.mp4
002 Big O Notations (Big O, Big Omega, Big Theta).mp4
007 How to Measure the Code using Big O_.mp4
005 Drop Constants and Non Dominant Terms.mp4
009 How to Measure Recursive Algorithm with Multiple Calls_.mp4
001 What is Big O_.mp4
006 Addition vs Multiplication.mp4
004 Space Complexity.mp4
08 PROJECT 1 - Arrays
004 Download Resources.html
065 ArrayProject.java
002 Calculate Average Temperature.en.srt
003 Find the Days Above Average Temperature.en.srt
001 Goals - what you will make by the end of this section.en.srt
003 Find the Days Above Average Temperature.mp4
002 Calculate Average Temperature.mp4
001 Goals - what you will make by the end of this section.mp4
39 Divide and Conquer Algorithms
009 Convert One String to Another in Java.en.srt
011 Zero One Knapsack Problem in Java.en.srt
006 House Robber.en.srt
001 What is a Divide and Conquer Algorithm_.en.srt
013 Longest Common Subsequence Problem in Java.en.srt
002 Common Divide and Conquer Algorithms.en.srt
012 Longest Common Subsequence Problem.en.srt
007 House Robber in Java.en.srt
008 Convert One String to Another.en.srt
015 Longest Palindromic Subsequence Problem in Java.en.srt
004 Number Factor.en.srt
014 Longest Palindromic Subsequence Problem.en.srt
019 Number of Paths To Reach The Last Cell with Given Cost in Java.en.srt
005 Number Factor in Java.en.srt
018 Number of Paths To Reach The Last Cell with Given Cost.en.srt
016 Minimum Cost to Reach Last Cell.en.srt
010 Zero One Knapsack Problem.en.srt
017 Minimum Cost to Reach Last Cell in Java.en.srt
003 How to solve Fibonacci series using Divide and Conquer approach_.en.srt
020 Download Resources.html
366 ConvertOneStringToAnother.java
366 NumberOfPathsToReachLastCell.java
366 LongestPalindormicSubsequence.java
366 ZeroOneKnapsack.java
366 LongestCommonSubsequence.java
366 HouseRobber.java
366 MinCostToReachLastCell.java
366 NumberFactor.java
009 Convert One String to Another in Java.mp4
011 Zero One Knapsack Problem in Java.mp4
012 Longest Common Subsequence Problem.mp4
006 House Robber.mp4
018 Number of Paths To Reach The Last Cell with Given Cost.mp4
014 Longest Palindromic Subsequence Problem.mp4
013 Longest Common Subsequence Problem in Java.mp4
015 Longest Palindromic Subsequence Problem in Java.mp4
001 What is a Divide and Conquer Algorithm_.mp4
019 Number of Paths To Reach The Last Cell with Given Cost in Java.mp4
010 Zero One Knapsack Problem.mp4
007 House Robber in Java.mp4
008 Convert One String to Another.mp4
016 Minimum Cost to Reach Last Cell.mp4
004 Number Factor.mp4
017 Minimum Cost to Reach Last Cell in Java.mp4
005 Number Factor in Java.mp4
002 Common Divide and Conquer Algorithms.mp4
003 How to solve Fibonacci series using Divide and Conquer approach_.mp4
33 All Pairs Shortest Path Problem
002 Dry Run for All Pairs Shortest Path Problem.en.srt
001 What is All Pairs Shortest Path Problem_.en.srt
001 What is All Pairs Shortest Path Problem_.mp4
002 Dry Run for All Pairs Shortest Path Problem.mp4
41 CHALLENGING Dynamic Programming Problems
001 NOTE ON THIS SECTION.html
43 The Wild West
001 VERY IMPORTANT NOTE! PLEASE READ!.html
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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
[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 Java Data Structures and Algorithms Masterclass Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
