Other
The Complete Data Structures and Algorithms Course in Python
Torrent info
Torrent Files List
[TutsNode.com] - The Complete Data Structures and Algorithms Course in Python (Size: 10.74 GB) (Files: 1308)
[TutsNode.com] - The Complete Data Structures and Algorithms Course in Python
7. Arrays
11. One Dimensional Array Practice.mp4
11. One Dimensional Array Practice.srt
13. Insertion - Two Dimensional Array.srt
20. Download the Resources.html
20.1 twoDimensionalArrays1.py
20.2 arrayPractice.py
21. Feedback Time.html
16. Searching for an element in Two Dimensional Array.srt
5. Insertion Operation.srt
1. What is an Array.srt
14. Accessing an element of Two Dimensional Array.srt
7. Accessing an element of Array.srt
8. Searching for an element in Array.srt
12. Create Two Dimensional Array.srt
2. Types of Array.srt
15. Traversal - Two Dimensional Array.srt
3. Arrays in Memory.srt
17. Deletion - Two Dimensional Array.srt
4. Create an Array.srt
10. Time and Space complexity of One Dimensional Array.srt
18. Time and Space complexity of Two Dimensional Array.srt
9. Deleting an element from Array.srt
6. Traversal Operation.srt
19. When to useavoid array.srt
14. Accessing an element of Two Dimensional Array.mp4
2. Types of Array.mp4
16. Searching for an element in Two Dimensional Array.mp4
13. Insertion - Two Dimensional Array.mp4
1. What is an Array.mp4
15. Traversal - Two Dimensional Array.mp4
5. Insertion Operation.mp4
7. Accessing an element of Array.mp4
12. Create Two Dimensional Array.mp4
17. Deletion - Two Dimensional Array.mp4
8. Searching for an element in Array.mp4
4. Create an Array.mp4
3. Arrays in Memory.mp4
10. Time and Space complexity of One Dimensional Array.mp4
18. Time and Space complexity of Two Dimensional Array.mp4
6. Traversal Operation.mp4
9. Deleting an element from Array.mp4
19. When to useavoid array.mp4
5. Big O Notation
3.1 Python range function.pdf
7.1 How to measure the codes using Big O.pdf
11.2 How to measure the codes using Big O.pdf
3. Time complexity examples.srt
1.1 timeComplexities.py
6. Add vs Multiply.srt
10. Time Complexities.html
11. Download the Resources.html
11.1 timeComplexities.py
12. Feedback Time.html
8. How to find time complexity for Recursive calls.srt
2. Big O, Big Theta and Big Omega.srt
7. How to measure the codes using Big O.srt
9. How to measure Recursive Algorithms that make multiple calls.srt
1. Analogy and Time Complexity.srt
5. Drop the Constants and the non dominant terms.srt
4. Space Complexity.srt
3. Time complexity examples.mp4
8. How to find time complexity for Recursive calls.mp4
2. Big O, Big Theta and Big Omega.mp4
7. How to measure the codes using Big O.mp4
9. How to measure Recursive Algorithms that make multiple calls.mp4
1. Analogy and Time Complexity.mp4
5. Drop the Constants and the non dominant terms.mp4
4. Space Complexity.mp4
6. Add vs Multiply.mp4
2. Recursion
6.1 Assert keyword.pdf
8.2 Assert keyword.pdf
6. How to write Recursion in 3 steps.srt
8. Download the Resources.html
8.1 recursion.py
9. Feedback Time.html
7. How to find Fibonacci numbers using Recursion.srt
3. How Recursion works.srt
5. When to useavoid Recursion.srt
1. What is Recursion.srt
4. Recursive vs Iterative Solutions.srt
2. Why do we need recursion.srt
6. How to write Recursion in 3 steps.mp4
7. How to find Fibonacci numbers using Recursion.mp4
1. What is Recursion.mp4
3. How Recursion works.mp4
5. When to useavoid Recursion.mp4
4. Recursive vs Iterative Solutions.mp4
2. Why do we need recursion.mp4
1. Introduction
5.1 Primitive Data Structures.pdf
7. Introduction to DS and Algorithms.html
1. Curriculum Walkthrough.srt
6. Types of Algorithms.srt
4. Why are Data Structures and Algorithms important.srt
3. What is an algorithm.srt
2. What are Data Structures.srt
5. Types of Data Structures.srt
1. Curriculum Walkthrough.mp4
4. Why are Data Structures and Algorithms important.mp4
3. What is an algorithm.mp4
2. What are Data Structures.mp4
6. Types of Algorithms.mp4
5. Types of Data Structures.mp4
40. Cracking Trees and Graphs Top Interview Questions (Apple, Amazon, Facebook)
15. Solution to Build Order.srt
15. Solution to Build Order.mp4
7. Solution to List of Depths.srt
17. Solution to First Common Ancestor.srt
5. Solution to Minimal Tree.srt
11. Solution to Validate BST - LeetCode 98.srt
13. Solution to Successor.srt
9. Solution to Check Balanced.srt
3. Solution to Route Between Nodes.srt
1. Introduction.srt
2. Route Between Nodes.html
4. Minimal Tree.html
6. List of Depths.html
8. Check Balanced - LeetCode 110.html
10. Validate BST - LeetCode 98.html
12. In-order Successor in BST - LeetCode 285.html
14. Build Order.html
16. First Common Ancestor - LeetCode 236.html
7. Solution to List of Depths.mp4
17. Solution to First Common Ancestor.mp4
5. Solution to Minimal Tree.mp4
9. Solution to Check Balanced.mp4
13. Solution to Successor.mp4
11. Solution to Validate BST - LeetCode 98.mp4
3. Solution to Route Between Nodes.mp4
1. Introduction.mp4
4. Bonus CHALLENGING Recursion Problems
18.13 collectString.py
1. power.html
2. factorial.html
3. productofArray.html
4. recursiveRange.html
5. fib.html
6. SOLUTIONS PART 1.html
7. reverse.html
8. isPalindrome.html
9. someRecursive.html
10. flatten.html
11. SOLUTIONS PART 2.html
12. captalizeFirst.html
13. nestedEvenSum.html
14. capitalizeWords.html
15. stringifyNumbers.html
16. collectStrings.html
17. SOLUTION PART 2.html
18. Download the Resources.html
18.1 flatten.py
18.2 recursiveRange.py
18.3 productOfArray.py
18.4 isPalindrome.py
18.5 power.py
18.6 captalizeFirst.py
18.7 someRecursive.py
18.8 factorial.py
18.9 reverse.py
18.10 capitalizeWords.py
18.11 fib.py
18.12 stringfyiNumber.py
18.14 nestedEvenSum.py
28. Sort Algorithms
9. Quick Sort.srt
10. Heap Sort.srt
8. Merge Sort.srt
4. Bubble Sort.srt
7. Bucket Sort.srt
6. Insertion Sort.srt
5. Selection Sort.srt
2. Types of Sorting.srt
3. Sorting Terminologies.srt
1. What is Sorting.srt
12.1 SortingAlgorithms.py
11. Comparison of Sorting Algorithms.srt
13. Feedback Time.html
12. Download Resources.html
9. Quick Sort.mp4
10. Heap Sort.mp4
8. Merge Sort.mp4
7. Bucket Sort.mp4
5. Selection Sort.mp4
6. Insertion Sort.mp4
4. Bubble Sort.mp4
2. Types of Sorting.mp4
3. Sorting Terminologies.mp4
1. What is Sorting.mp4
11. Comparison of Sorting Algorithms.mp4
20. Queue
5. Circular Queue - Python List, Operations (enqueue, dequeue, peek, delete).srt
3. Queue using Python List - no size limit , operations (enqueue, dequeue, peek).srt
8. Queue - Linked List, Operations (Dequeue(), isEmpty, Peek).srt
6. Queue - Linked List.srt
7. Queue - Linked List, Operations (Create, Enqueue).srt
2. Queue using Python List - no size limit.srt
4. Circular Queue - Python List.srt
12. Queue Module.srt
11. Collections Module.srt
1. What is Queue.srt
10. List vs Linked List Implementation.srt
9. Time and Space complexity of Queue using Linked List.srt
14. Download the Resources.html
14.1 MultiprocessingQueue.py
14.2 QueueNoSize.py
14.3 QueueModule.py
14.4 QueueWithCapacity.py
14.5 QueueLinkedList.py
14.6 Deque.py
15. Feedback Time.html
13. Multiprocessing module.srt
5. Circular Queue - Python List, Operations (enqueue, dequeue, peek, delete).mp4
3. Queue using Python List - no size limit , operations (enqueue, dequeue, peek).mp4
8. Queue - Linked List, Operations (Dequeue(), isEmpty, Peek).mp4
7. Queue - Linked List, Operations (Create, Enqueue).mp4
6. Queue - Linked List.mp4
12. Queue Module.mp4
11. Collections Module.mp4
2. Queue using Python List - no size limit.mp4
1. What is Queue.mp4
4. Circular Queue - Python List.mp4
10. List vs Linked List Implementation.mp4
13. Multiprocessing module.mp4
9. Time and Space complexity of Queue using Linked List.mp4
22. Tree Binary Tree
15. Delete a node from Binary Tree (Linked List).srt
12. LevelOrder Traversal Binary Tree (Linked List).srt
9. PreOrder Traversal Binary Tree (Linked List).srt
14. Inserting a node in Binary Tree (Linked List).srt
11. PostOrder Traversal Binary Tree (Linked List).srt
10. InOrder Traversal Binary Tree (Linked List).srt
13. Searching for a node in Binary Tree (Linked List).srt
1. What is a Tree.srt
4. How to create basic tree in Python.srt
20. PreOrder Traversal Binary Tree (Python List).srt
7. Binary Tree Representation.srt
24. Delete a node from Binary Tree (Python List).srt
17. Create Binary Tree (Python List).srt
18. Insert a value Binary Tree (Python List).srt
3. Tree Terminology.srt
26. Linked List vs Python List Binary Tree.srt
21. InOrder Traversal Binary Tree (Python List).srt
19. Search for a node in Binary Tree (Python List).srt
22. PostOrder Traversal Binary Tree (Python List).srt
6. Types of Binary Tree.srt
27.3 BinaryTree.py
8. Create Binary Tree (Linked List).srt
23. Level Order Traversal Binary Tree (Python List).srt
16. Delete entire Binary Tree (Linked List).srt
15. Delete a node from Binary Tree (Linked List).mp4
2. Why Tree.srt
5. Binary Tree.srt
25. Delete Entire Binary Tree (Python List).srt
27.4 BinaryTreePL.py
27.2 QueueLinkedList.py
27.1 CreateTree.py
27. Download the Resources.html
28. Feedback Time.html
12. LevelOrder Traversal Binary Tree (Linked List).mp4
9. PreOrder Traversal Binary Tree (Linked List).mp4
14. Inserting a node in Binary Tree (Linked List).mp4
13. Searching for a node in Binary Tree (Linked List).mp4
10. InOrder Traversal Binary Tree (Linked List).mp4
11. PostOrder Traversal Binary Tree (Linked List).mp4
24. Delete a node from Binary Tree (Python List).mp4
4. How to create basic tree in Python.mp4
20. PreOrder Traversal Binary Tree (Python List).mp4
1. What is a Tree.mp4
18. Insert a value Binary Tree (Python List).mp4
19. Search for a node in Binary Tree (Python List).mp4
21. InOrder Traversal Binary Tree (Python List).mp4
17. Create Binary Tree (Python List).mp4
26. Linked List vs Python List Binary Tree.mp4
22. PostOrder Traversal Binary Tree (Python List).mp4
3. Tree Terminology.mp4
16. Delete entire Binary Tree (Linked List).mp4
23. Level Order Traversal Binary Tree (Python List).mp4
7. Binary Tree Representation.mp4
8. Create Binary Tree (Linked List).mp4
25. Delete Entire Binary Tree (Python List).mp4
6. Types of Binary Tree.mp4
2. Why Tree.mp4
5. Binary Tree.mp4
24. AVL Tree
9. Insert a node in AVL (method).srt
8. Insert a node in AVL (all together).srt
4. Insert a node in AVL (Left Left Condition).srt
3. Common Operations on AVL Trees.srt
12. Delete a node from AVL (method).srt
5. Insert a node in AVL (Left Right Condition).srt
6. Insert a node in AVL (Right Right Condition).srt
9. Insert a node in AVL (method).mp4
10. Delete a node from AVL (LL, LR, RR, RL).srt
1. What is an AVL Tree.srt
7. Insert a node in AVL (Right Left Condition).srt
14. Time and Space complexity of AVL Tree.srt
2. Why AVL Tree.srt
11. Delete a node from AVL (all together).srt
15.1 AVL.py
13. Delete entire AVL.srt
15.2 QueueLinkedList.py
16. Feeback Time.html
15. Download the Resources.html
12. Delete a node from AVL (method).mp4
3. Common Operations on AVL Trees.mp4
8. Insert a node in AVL (all together).mp4
4. Insert a node in AVL (Left Left Condition).mp4
5. Insert a node in AVL (Left Right Condition).mp4
7. Insert a node in AVL (Right Left Condition).mp4
6. Insert a node in AVL (Right Right Condition).mp4
10. Delete a node from AVL (LL, LR, RR, RL).mp4
1. What is an AVL Tree.mp4
13. Delete entire AVL.mp4
11. Delete a node from AVL (all together).mp4
14. Time and Space complexity of AVL Tree.mp4
2. Why AVL Tree.mp4
26. Trie
5. Delete a string from Trie.srt
1. What is a Trie Why we need it.srt
3. Insert a string in Trie.srt
4. Search for a string in Trie.srt
2. Common Operations on Trie (Creation).srt
6. Practical use of Trie.srt
7.1 Trie.py
8. Feedback Time.html
7. Download the Resources.html
5. Delete a string from Trie.mp4
3. Insert a string in Trie.mp4
1. What is a Trie Why we need it.mp4
4. Search for a string in Trie.mp4
2. Common Operations on Trie (Creation).mp4
6. Practical use of Trie.mp4
12. Dictionaries
8. Dictionary Methods.srt
9. Dictionary operations built in functions.srt
12. Dictionary Interview Questions.html
13. Download the Resources.html
13.1 dictionaryQuiz.py
13.2 dictionary1.py
14. Feedback Time.html
7. Delete Remove an element from a Dictionary.srt
1. What is a Dictionary.srt
2. Create a Dictionary.srt
3. Dictionaries in memory.srt
4. Insert Update an element in a Dictionary.srt
5. Traverse through a Dictionary.srt
11. Time and Space Complexity of a Dictionary.srt
6. Search for an element in a Dictionary.srt
10. Dictionary vs List.srt
8. Dictionary Methods.mp4
9. Dictionary operations built in functions.mp4
7. Delete Remove an element from a Dictionary.mp4
2. Create a Dictionary.mp4
6. Search for an element in a Dictionary.mp4
5. Traverse through a Dictionary.mp4
4. Insert Update an element in a Dictionary.mp4
11. Time and Space Complexity of a Dictionary.mp4
1. What is a Dictionary.mp4
3. Dictionaries in memory.mp4
10. Dictionary vs List.mp4
25. Binary Heap
4. Extract a node from Binary Heap.srt
3. Insert a node in Binary Heap.srt
2. Common operations (Creation, Peek, sizeofheap) on Binary Heap.srt
1. What is Binary Heap Why do we need it.srt
6. Time and space complexity of Binary Heap.srt
7.1 BinaryHeap.py
5. Delete entire Binary Heap.srt
8. Feedback Time.html
7. Download the Resources.html
4. Extract a node from Binary Heap.mp4
3. Insert a node in Binary Heap.mp4
2. Common operations (Creation, Peek, sizeofheap) on Binary Heap.mp4
1. What is Binary Heap Why do we need it.mp4
6. Time and space complexity of Binary Heap.mp4
5. Delete entire Binary Heap.mp4
18. Cracking Linked List Interview Questions (Amazon, Facebook, Apple and Microsoft)
2. Question 1 - Remove Dups.srt
1. Linked List Class.srt
6. Question 5 - Intersection.srt
4. Question 3 - Partition.srt
5. Question 4 - Sum Linked Lists.srt
3. Question 2 - Return Kth to Last.srt
7. Download the Resources.html
7.1 Q2_ReturnKthToLast.py
7.2 Q1_RemoveDups.py
7.3 Q4_SumLists.py
7.4 LinkedList.py
7.5 Q3_Partition.py
7.6 Q5_Intersection.py
8. Feedback Time.html
2. Question 1 - Remove Dups.mp4
1. Linked List Class.mp4
6. Question 5 - Intersection.mp4
4. Question 3 - Partition.mp4
5. Question 4 - Sum Linked Lists.mp4
3. Question 2 - Return Kth to Last.mp4
43. Dynamic Programming
7. Number Factor Problem using Dynamic Programming.srt
3. Top Down with Memoization.srt
9. House Robber Problem using Dynamic Programming.srt
13. Zero One Knapsack using Dynamic Programming.srt
8. Number Factor Top Down and Bottom Up.srt
10. House Robber Top Down and Bottom Up.srt
4. Bottom Up with Tabulation.srt
11. Convert one string to another using Dynamic Programming.srt
1. What is Dynamic Programming (Overlapping property).srt
5. Top Down vs Bottom Up.srt
6. Is Merge Sort Dynamic Programming.srt
2. Where does the name of DP come from.srt
12. Convert String using Bottom Up.html
14. Zero One Knapsack - Top Down.html
15. Zero One Knapsack - Bottom Up.html
3. Top Down with Memoization.mp4
13. Zero One Knapsack using Dynamic Programming.mp4
9. House Robber Problem using Dynamic Programming.mp4
7. Number Factor Problem using Dynamic Programming.mp4
10. House Robber Top Down and Bottom Up.mp4
8. Number Factor Top Down and Bottom Up.mp4
4. Bottom Up with Tabulation.mp4
11. Convert one string to another using Dynamic Programming.mp4
2. Where does the name of DP come from.mp4
1. What is Dynamic Programming (Overlapping property).mp4
6. Is Merge Sort Dynamic Programming.mp4
5. Top Down vs Bottom Up.mp4
21. Cracking Stack and Queue Interview Questions (Amazon,Facebook, Apple, Microsoft)
1. Question 1 - Three in One.srt
2. Question 2 - Stack Minimum.srt
3. Question 3 - Stack of Plates.srt
5. Question 5 - Animal Shelter.srt
4. Question 4 - Queue via Stacks.srt
6. Download Resources.html
6.1 Q5_AnimalShelter.py
6.2 Q4_QueueStack.py
6.3 Q3_StackPlates.py
6.4 Q2_Stack.py
6.5 Q6_SortStack.py
6.6 Q1_Stack.py
7. Feedback Time.html
1. Question 1 - Three in One.mp4
2. Question 2 - Stack Minimum.mp4
3. Question 3 - Stack of Plates.mp4
5. Question 5 - Animal Shelter.mp4
4. Question 4 - Queue via Stacks.mp4
15. Circular Singly Linked List
9. Delete Method in Circular Singlu Linked List.srt
4. Insertion method in Circular Singly Linked List.srt
1. Creation of Circular Singly Linked List.srt
6. Searching a node in Circular Singly Linked List.srt
7. Deletion of a node from Circular Singly Linked List.srt
2. Insertion in Circular Singly Linked List.srt
5. Traversal of Circular Singly Linked List.srt
10. Deletion of entire Circular Singly Linked List.srt
8. Deletion Algorithm in Circular Singly Linked List.srt
11. Time and Space Complexity of Circular Singly Linked List.srt
3. Insertion Algorithm in Circular Singly Linked List.srt
9. Delete Method in Circular Singlu Linked List.mp4
4. Insertion method in Circular Singly Linked List.mp4
6. Searching a node in Circular Singly Linked List.mp4
1. Creation of Circular Singly Linked List.mp4
5. Traversal of Circular Singly Linked List.mp4
7. Deletion of a node from Circular Singly Linked List.mp4
10. Deletion of entire Circular Singly Linked List.mp4
2. Insertion in Circular Singly Linked List.mp4
11. Time and Space Complexity of Circular Singly Linked List.mp4
8. Deletion Algorithm in Circular Singly Linked List.mp4
3. Insertion Algorithm in Circular Singly Linked List.mp4
23. Binary Search Tree
6. Delete a node from BST.srt
4. Traverse BST.srt
3. Insert a node to BST.srt
5. Search in BST.srt
1. What is a Binary Search Tree Why do we need it.srt
8. Time and Space complexity of BST.srt
7. Delete entire BST.srt
2. Create a Binary Search Tree.srt
9.1 BST.py
9.2 QueueLinkedList.py
10. Feedback Time.html
9. Download the Resources.html
4. Traverse BST.mp4
6. Delete a node from BST.mp4
3. Insert a node to BST.mp4
5. Search in BST.mp4
7. Delete entire BST.mp4
2. Create a Binary Search Tree.mp4
8. Time and Space complexity of BST.mp4
1. What is a Binary Search Tree Why do we need it.mp4
3. Cracking Recursion Interview Questions
5. Download the Resources.html
5.1 recursionInterview.py
6. Feedback Time.html
1. Question 1 - Sum of Digits.srt
4. Question 4 - Decimal To Binary.srt
3. Question 3 - Greatest Common Divisor.srt
2. Question 2 - Power.srt
1. Question 1 - Sum of Digits.mp4
3. Question 3 - Greatest Common Divisor.mp4
4. Question 4 - Decimal To Binary.mp4
2. Question 2 - Power.mp4
14. Linked List
8. Insertion Method in Singly Linked List.srt
3. Types of Linked List.srt
12. Deletion Method in Singly Linked List.srt
11. Deletion of node from Singly Linked List.srt
7. Insertion in Singly Linked List Algorithm.srt
10. Search for a value in Single Linked List.srt
15. Time Complexity of Linked List vs Arrays.srt
1. What is a Linked List.srt
5. Creation of Singly Linked List.srt
9. Traversal of Singly Linked List.srt
16. Download the Resources.html
17. Feedback Time.html
2. Linked List vs Arrays.srt
13. Deletion of entire Singly Linked List.srt
6. Insertion in Singly Linked List in Memory.srt
16.2 CircularDoublyLinkedList.py
4. Linked List in the Memory.srt
16.4 DoublyLinkedList.py
16.5 CircurlarSinglyLinkedList.py
14. Time and Space Complexity of Singly Linked List.srt
16.1 createSinglyLinkedList.py
16.3 SinglyLinkedList.py
8. Insertion Method in Singly Linked List.mp4
12. Deletion Method in Singly Linked List.mp4
3. Types of Linked List.mp4
1. What is a Linked List.mp4
11. Deletion of node from Singly Linked List.mp4
10. Search for a value in Single Linked List.mp4
7. Insertion in Singly Linked List Algorithm.mp4
5. Creation of Singly Linked List.mp4
9. Traversal of Singly Linked List.mp4
15. Time Complexity of Linked List vs Arrays.mp4
13. Deletion of entire Singly Linked List.mp4
2. Linked List vs Arrays.mp4
6. Insertion in Singly Linked List in Memory.mp4
14. Time and Space Complexity of Singly Linked List.mp4
4. Linked List in the Memory.mp4
16. Doubly Linked List
10. Deletion Method in Doubly Linked List.srt
4. Insertion Method in Doubly Linked List.srt
1. Creation of Doubly Linked List.srt
8. Deletion of a node in Doubly Linked List.srt
11. Deletion of entire Doubly Linked List.srt
2. Insertion in Doubly Linked List.srt
7. Searching for a node in Doubly Linked List.srt
3. Insertion Algorithm in Doubly Linked List.srt
5. Traversal of Doubly Linked List.srt
6. Reverse Traversal of Doubly Linked List.srt
12. Time and Space Complexity of Doubly Linked List.srt
9. Deletion Algorithm in Doubly Linked List.srt
4. Insertion Method in Doubly Linked List.mp4
10. Deletion Method in Doubly Linked List.mp4
1. Creation of Doubly Linked List.mp4
11. Deletion of entire Doubly Linked List.mp4
7. Searching for a node in Doubly Linked List.mp4
8. Deletion of a node in Doubly Linked List.mp4
5. Traversal of Doubly Linked List.mp4
6. Reverse Traversal of Doubly Linked List.mp4
2. Insertion in Doubly Linked List.mp4
12. Time and Space Complexity of Doubly Linked List.mp4
3. Insertion Algorithm in Doubly Linked List.mp4
9. Deletion Algorithm in Doubly Linked List.mp4
17. Circular Doubly Linked List
10. Deletion Method in Circular Doubly Linked List.srt
4. Insertion Method in Circular Doubly Linked List.srt
2. Insertion in Circular Doubly Linked List.srt
1. Creation of Circular Doubly Linked List.srt
8. Delete a node from Circular Doubly Linked List.srt
11. Delete Entire Circular Doubly Linked List.srt
7. Search for a node in Circular Doubly Linked List.srt
5. Traversal of Circular Doubly Linked List.srt
6. Reverse Traversal of Circular Doubly Linked List.srt
9. Deletion Algorithm in Circular Doubly Linked List.srt
3. Insertion Algorithm in Circular Doubly Linked List.srt
12. Time and Space Complexity of Circular Doubly Linked List.srt
10. Deletion Method in Circular Doubly Linked List.mp4
4. Insertion Method in Circular Doubly Linked List.mp4
11. Delete Entire Circular Doubly Linked List.mp4
1. Creation of Circular Doubly Linked List.mp4
7. Search for a node in Circular Doubly Linked List.mp4
8. Delete a node from Circular Doubly Linked List.mp4
5. Traversal of Circular Doubly Linked List.mp4
2. Insertion in Circular Doubly Linked List.mp4
6. Reverse Traversal of Circular Doubly Linked List.mp4
9. Deletion Algorithm in Circular Doubly Linked List.mp4
3. Insertion Algorithm in Circular Doubly Linked List.mp4
12. Time and Space Complexity of Circular Doubly Linked List.mp4
29. Searching Algorithms
5. Binary Search in Python.srt
3. Linear Search in Python.srt
6. Time Complexity of Binary Search.srt
2. Linear Search.srt
4. Binary Search.srt
1. Introduction to Searching Algorithms.srt
7.2 BinarySearch.py
7.1 LinearSearch.py
7. Download Resources.html
5. Binary Search in Python.mp4
3. Linear Search in Python.mp4
6. Time Complexity of Binary Search.mp4
2. Linear Search.mp4
4. Binary Search.mp4
1. Introduction to Searching Algorithms.mp4
27. Hashing
4. Types of Collision Resolution Techniques.srt
3. Hash Functions.srt
1. What is Hashing Why we need it.srt
6. Pros and Cons of Resolution Techniques.srt
7. Practical Use of Hashing.srt
5. Hash Table is Full.srt
2. Hashing Terminology.srt
8. Hashing vs Other DS.srt
10. Feedback Time.html
9.1 Hashing.py
9. Download the Resources.html
4. Types of Collision Resolution Techniques.mp4
3. Hash Functions.mp4
1. What is Hashing Why we need it.mp4
7. Practical Use of Hashing.mp4
6. Pros and Cons of Resolution Techniques.mp4
2. Hashing Terminology.mp4
5. Hash Table is Full.mp4
8. Hashing vs Other DS.mp4
6. Top 10 Big O Interview Questions (Amazon, Facebook, Apple and Microsoft)
2. Question 2 - Print Pairs.srt
4. Question 4 - Print Unordered Pairs 2 Arrays.srt
5. Question 5 - Print Unordered Pairs 2 Arrays 100000 Units.srt
11. Download the Resources.html
11.1 interviewQuestionsBigO.py
12. Feedback Time.html
8. Question 8 - Factorial Complexity.srt
3. Question 3 - Print Unordered Pairs.srt
9. Question 9 - Fibonacci Complexity.srt
7. Question 7 - O(N) Equivalents.srt
1. Question 1 - Product and Sum.srt
10. Question 10 - Powers of 2.srt
6. Question 6 - Reverse.srt
8. Question 8 - Factorial Complexity.mp4
3. Question 3 - Print Unordered Pairs.mp4
7. Question 7 - O(N) Equivalents.mp4
1. Question 1 - Product and Sum.mp4
9. Question 9 - Fibonacci Complexity.mp4
10. Question 10 - Powers of 2.mp4
6. Question 6 - Reverse.mp4
4. Question 4 - Print Unordered Pairs 2 Arrays.mp4
2. Question 2 - Print Pairs.mp4
5. Question 5 - Print Unordered Pairs 2 Arrays 100000 Units.mp4
10. Cracking ArrayList Interview Questions (Amazon, Facebook, Apple and Microsoft)
7. Question 7 - Rotate Matrix Image - LeetCode 48.srt
8. Download the Resources.html
8.1 ListInterview.py
9. Feedback Time.html
2. Question 2 - Pairs Two Sum - LeetCode 1.srt
6. Question 6 - Permutation.srt
4. Question 4 - Max product of two int.srt
1. Question 1 - Missing Number.srt
5. Question 5 - Is Unique Contains Duplicate - LeetCode 217.srt
3. Question 3 - Finding a number in an Array.srt
7. Question 7 - Rotate Matrix Image - LeetCode 48.mp4
4. Question 4 - Max product of two int.mp4
2. Question 2 - Pairs Two Sum - LeetCode 1.mp4
6. Question 6 - Permutation.mp4
1. Question 1 - Missing Number.mp4
5. Question 5 - Is Unique Contains Duplicate - LeetCode 217.mp4
3. Question 3 - Finding a number in an Array.mp4
19. Stack
5. Create Stack with limit (pop, push, peek, isFull, isEmpty, delete).srt
7. Operation on Stack using Linked List (pop, push, peek, isEmpty, delete).srt
4. Operations on Stack using List (push, pop, peek, isEmpty, Delete).srt
2. Stack Operations.srt
6. Create Stack using Linked List.srt
1. What is a Stack.srt
8. Time and Space Complexity of Stack using Linked List.srt
3. Create Stack using List without size limit.srt
9. When to useavoid Stack.srt
10. Stack Quiz.html
11. Download the Resources.html
11.1 StackLinkedList.py
11.2 StackList.py
11.3 stack.py
11.4 StackListLimited.py
12. Feedback Time.html
7. Operation on Stack using Linked List (pop, push, peek, isEmpty, delete).mp4
4. Operations on Stack using List (push, pop, peek, isEmpty, Delete).mp4
5. Create Stack with limit (pop, push, peek, isFull, isEmpty, delete).mp4
1. What is a Stack.mp4
2. Stack Operations.mp4
6. Create Stack using Linked List.mp4
3. Create Stack using List without size limit.mp4
8. Time and Space Complexity of Stack using Linked List.mp4
9. When to useavoid Stack.mp4
35. Graph Algorithms -Bellman Ford Algorithm
1. Bellman Ford Algorithm.srt
4. Bellman Ford in Python.srt
2. Bellman Ford Algorithm with negative cycle.srt
3. Why Bellman Ford runs V-1 times.srt
5. BFS vs Dijkstra vs Bellman Ford.srt
6.1 BellmanFord.py
6. Download Resources.html
1. Bellman Ford Algorithm.mp4
4. Bellman Ford in Python.mp4
2. Bellman Ford Algorithm with negative cycle.mp4
5. BFS vs Dijkstra vs Bellman Ford.mp4
3. Why Bellman Ford runs V-1 times.mp4
8. Python Lists
3. UpdateInsert a List.srt
6. List OperationsFunctions.srt
2. AccessingTraversing a list.srt
4. SliceDelete from a List.srt
11. List Interview Questions.html
12. Download the Resources.html
12.1 lists.py
12.2 listQuiz.py
13. Feedback Time.html
5. Searching for an element in a List.srt
1. What is a List How to create it.srt
8. Common List pitfalls and ways to avoid them.srt
10. Time and Space Complexity of List.srt
7. Lists and strings.srt
9. Lists vs Arrays.srt
6. List OperationsFunctions.mp4
3. UpdateInsert a List.mp4
2. AccessingTraversing a list.mp4
4. SliceDelete from a List.mp4
5. Searching for an element in a List.mp4
8. Common List pitfalls and ways to avoid them.mp4
7. Lists and strings.mp4
1. What is a List How to create it.mp4
9. Lists vs Arrays.mp4
10. Time and Space Complexity of List.mp4
45. A Recipe for Problem Solving
5. Step 4 - Solve or Simplify.srt
6. Step 5 - Look Back and Refactor.srt
4. Step 3 - Break it Down.srt
2. Step 1 - Understand the problem.srt
3. Step 2 - Examples.srt
1. Introduction.srt
5. Step 4 - Solve or Simplify.mp4
4. Step 3 - Break it Down.mp4
6. Step 5 - Look Back and Refactor.mp4
2. Step 1 - Understand the problem.mp4
3. Step 2 - Examples.mp4
1. Introduction.mp4
41. Greedy Algorithms
2. Greedy Algorithms (Insertion Sort, Selection Sort, Prim, Kruskal, Topological ).srt
8. Fractional Knapsack Problem in Python.srt
1. What is Greedy Algorithm.srt
3. Activity Selection Problem.srt
7. Fractional Knapsack Problem.srt
4. Activity Selection Problem in Python.srt
5. Coin Change Problem.srt
6. Coin Change Problem in Python.srt
9.3 FractionalKnapsack.py
9.1 ActivitySelection.py
9.2 CoinChange.py
9. Download the Resources.html
8. Fractional Knapsack Problem in Python.mp4
1. What is Greedy Algorithm.mp4
2. Greedy Algorithms (Insertion Sort, Selection Sort, Prim, Kruskal, Topological ).mp4
7. Fractional Knapsack Problem.mp4
4. Activity Selection Problem in Python.mp4
3. Activity Selection Problem.mp4
6. Coin Change Problem in Python.mp4
5. Coin Change Problem.mp4
30. Graph Algorithms
4. Graph Representation.srt
3. Types of Graph.srt
5. Create a graph using Python.srt
2. Graph Terminology.srt
1. What is a Graph Why Graph.srt
7.5 DijkstraSSSP.py
7.1 Kruskal.py
7.9 BellmanFord.py
7.8 Prims.py
7.4 Graph.py
7.2 TopologicalSort.py
7.6 DisjointSet.py
7.3 SSSP.py
7.7 FloydWarshall.py
6. Feedback Time.html
7. Download Resources.html
4. Graph Representation.mp4
1. What is a Graph Why Graph.mp4
5. Create a graph using Python.mp4
2. Graph Terminology.mp4
3. Types of Graph.mp4
34. Graph Algorithms - Dijsktra's Algorithm
2. Dijkstra's Algorithm in Python.srt
1. Dijkstra's Algorithm for SSSP.srt
3. Dijkstra Algorithm with negative cycle.srt
4.1 DijkstraSSSP.py
4. Download Resources.html
2. Dijkstra's Algorithm in Python.mp4
1. Dijkstra's Algorithm for SSSP.mp4
3. Dijkstra Algorithm with negative cycle.mp4
38. Minimum Spanning Tree (Disjoint Set)
3. Disjoint Set in Python.srt
1. Minimum Spanning Tree.srt
2. Disjoint Set.srt
4.1 DisjointSet.py
4. Download Resources.html
1. Minimum Spanning Tree.mp4
3. Disjoint Set in Python.mp4
2. Disjoint Set.mp4
32. Topological Sort Algorithm
3. Topological Sort in Python.srt
2. Topological Sort Algorithm.srt
1. Topological Sort.srt
4.1 TopologicalSort.py
4. Download Resources.html
3. Topological Sort in Python.mp4
2. Topological Sort Algorithm.mp4
1. Topological Sort.mp4
31. Graph Traversal - Breadth First Search and Depth First Search
1. Graph traversal - BFS.srt
3. Graph Traversal - DFS.srt
2. BFS Traversal in Python.srt
4. DFS Traversal in Python.srt
5. BFS Traversal vs DFS Traversal.srt
6.1 Graph.py
6. Download Resources.html
1. Graph traversal - BFS.mp4
2. BFS Traversal in Python.mp4
4. DFS Traversal in Python.mp4
3. Graph Traversal - DFS.mp4
5. BFS Traversal vs DFS Traversal.mp4
42. Divide and Conquer Algorithms
6. House Robber.srt
1. What is a Divide and Conquer Algorithm.srt
2. Common Divide and Conquer algorithms.srt
12. Longest Common Sequence Problem.srt
8. Convert one string to another.srt
11. Zero One Knapsack problem in Python.srt
4. Number Factor.srt
9. Convert One String to another in Python.srt
14. Longest Palindromic Subsequence Problem.srt
16. Minimum cost to reach the Last cell problem.srt
18. Number of Ways to reach the Last Cell with given Cost.srt
10. Zero One Knapsack problem.srt
3. How to solve Fibonacci series using Divide and Conquer approach.srt
19. Number of Ways to reach the Last Cell with given Cost in Python.srt
7. House Robber Problem in Python.srt
13. Longest Common Subsequence in Python.srt
15. Longest Palindromic Subsequence in Python.srt
17. Minimum Cost to reach the Last Cell in 2D array using Python.srt
5. Number Factor in Python.srt
20.8 NumberofPaths.py
20.4 ZeroOneKnapsack.py
20.1 ConvertString.py
20.2 MinCost2D.py
20.5 LongestPolindormic.py
20.3 LongestCommon.py
20.7 HouseRobber.py
20.6 NumberFactor.py
20. Download the Resources.html
11. Zero One Knapsack problem in Python.mp4
9. Convert One String to another in Python.mp4
12. Longest Common Sequence Problem.mp4
6. House Robber.mp4
14. Longest Palindromic Subsequence Problem.mp4
18. Number of Ways to reach the Last Cell with given Cost.mp4
1. What is a Divide and Conquer Algorithm.mp4
10. Zero One Knapsack problem.mp4
8. Convert one string to another.mp4
19. Number of Ways to reach the Last Cell with given Cost in Python.mp4
4. Number Factor.mp4
16. Minimum cost to reach the Last cell problem.mp4
7. House Robber Problem in Python.mp4
2. Common Divide and Conquer algorithms.mp4
13. Longest Common Subsequence in Python.mp4
3. How to solve Fibonacci series using Divide and Conquer approach.mp4
15. Longest Palindromic Subsequence in Python.mp4
17. Minimum Cost to reach the Last Cell in 2D array using Python.mp4
5. Number Factor in Python.mp4
13. Tuples
6. Tuple vs List.srt
3. Traversing a Tuple.srt
8. Tuple Questions.html
9. Download the Resources.html
9.1 tuple.py
9.2 tupleQuiz.py
10. Feedback Time.html
2. Tuples in Memory Accessing an element of Tuple.srt
1. What is a Tuple How to create it.srt
5. Tuple OperationsFunctions.srt
4. Search for an element in Tuple.srt
7. Time and Space complexity of Tuples.srt
6. Tuple vs List.mp4
4. Search for an element in Tuple.mp4
2. Tuples in Memory Accessing an element of Tuple.mp4
1. What is a Tuple How to create it.mp4
5. Tuple OperationsFunctions.mp4
3. Traversing a Tuple.mp4
7. Time and Space complexity of Tuples.mp4
37. Graph Algorithms - Floyd Warshall Algorithm
4. Floyd Warshall in Python.srt
1. Floyd Warshall Algorithm.srt
2. Why Floyd Warshall.srt
5. BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall.srt
3. Floyd Warshall with negative cycle.srt
6.1 FloydWarshall.py
6. Download Resources.html
2. Why Floyd Warshall.mp4
1. Floyd Warshall Algorithm.mp4
4. Floyd Warshall in Python.mp4
5. BFS vs Dijkstra vs Bellman Ford vs Floyd Warshall.mp4
3. Floyd Warshall with negative cycle.mp4
39. Graph Algorithms - Kruskal and Prim's Algorithms
1. Kruskal Algorithm.srt
2. Kruskal Algorithm in Python.srt
4. Prim's Algorithm in Python.srt
3. Prim's Algorithm.srt
5. Prim's vs Kruskal.srt
6.2 Kruskal.py
6.1 Prims.py
6. Download Resources.html
2. Kruskal Algorithm in Python.mp4
3. Prim's Algorithm.mp4
4. Prim's Algorithm in Python.mp4
1. Kruskal Algorithm.mp4
5. Prim's vs Kruskal.mp4
11. CHALLENGING ArrayList Problems
1. Middle Function.html
2. 2D Lists.html
3. Best Score.html
4. Missing Number.html
5. Duplicate Number.html
6. Pairs.html
33. Single Source Shortest Path
3. BFS for SSSPP in Python.srt
2. BFS for SSSPP.srt
1. Single Source Shortest Path Problem (SSSPP).srt
4. Why does BFS not work with weighted Graph.srt
5. Why does DFS not work for SSSP.srt
6.1 SSSP.py
6. Download Resources.html
3. BFS for SSSPP in Python.mp4
1. Single Source Shortest Path Problem (SSSPP).mp4
2. BFS for SSSPP.mp4
4. Why does BFS not work with weighted Graph.mp4
5. Why does DFS not work for SSSP.mp4
9. PROJECT 1 - ArraysLists
3. Find the Days Above Average Temperature.srt
2. Calculate Average Temperature.srt
1. Goals - what you will make by the end of this section.srt
3. Find the Days Above Average Temperature.mp4
2. Calculate Average Temperature.mp4
1. Goals - what you will make by the end of this section.mp4
36. All Pairs Shortest Path
2. Dry run for All pair shortest path.srt
1. All pairs shortest path problem.srt
1. All pairs shortest path problem.mp4
2. Dry run for All pair shortest path.mp4
44. CHALLENGING Dynamic Programming Problems
1. NOTE ON THIS SECTION.html
2. Longest repeated Subsequence Length problem.html
3. Longest Common Subsequence Length problem.html
4. Longest Common Subsequence problem.html
5. Diff Utility.html
6. Shortest Common Supersequence Problem.html
7. Length of Longest Palindromic Subsequence.html
8. Subset Sum Problem.html
9. Egg Dropping Puzzle.html
10. Maximum Length Chain of Pairs.html
46. The Wild West
1. VERY IMPORTANT NOTE! PLEASE READ!.html
2. Singly Linked List - Push.html
3. Singly Linked List - Pop.html
4. Singly Linked List - Get.html
5. Singly Linked List - Insert.html
6. Singly Linked List - Rotate.html
7. Singly Linked List - Set.html
8. Divide and Conquer - countZeroes.html
9. Divide and Conquer - sortedFrequency.html
10. Divide and Conquer - findRotatedIndex.html
11. Singly Linked List - Remove.html
12. Insertion Sort.html
13. Bubble Sort.html
14. Sorting with Pivot Quicksort.html
15. Stack - Push.html
16. Stack - Pop.html
17. Stack with Two Queues.html
18. Queue - Enqueue.html
19. Binary Search Tree - Insert.html
20. Binary Search Tree - Find.html
21. Binary Search Tree - DFSPreOrder.html
22. Binary Search Tree - DFSInOrder.html
23. Binary Search Tree - DFSPostOrder.html
24. Binary Search Tree - Remove.html
25. Binary Search Tree - Check If Balanced.html
26. Max Binary Heap - Insert.html
27. Min Binary Heap - Insert.html
28. Max Binary Heap - Extract Max.html
29. Graph - Add Vertex.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
345
346
347
348
349
350
351
352
353
354
[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 The Complete Data Structures and Algorithms Course in Python Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
