Other
Algorithms and Data Structures in Python (INTERVIEW Q&A)
Torrent info
Torrent Files List
[TutsNode.com] - Algorithms and Data Structures in Python (INTERVIEW Q&A) (Size: 4.20 GB) (Files: 693)
[TutsNode.com] - Algorithms and Data Structures in Python (INTERVIEW Q&A)
31. Algorhyme FREE Algorithms Visualizer App
1. Algorithms Visualization App-en_US.srt
Algorhyme - Algorithms and Data Structures.html
1. Algorithms Visualization App.mp4
14. Data Structures - AVL Trees
9. AVL tree implementation IV.mp4
8. AVL tree implementation III.mp4
3. AVL trees introduction - height-pl_PL.srt
3. AVL trees introduction - height-en_US.srt
8. AVL tree implementation III-pl_PL.srt
8. AVL tree implementation III-en_US.srt
4. AVL trees introduction - rotations-pl_PL.srt
6. AVL tree implementation I-pl_PL.srt
4. AVL trees introduction - rotations-en_US.srt
6. AVL tree implementation I-en_US.srt
7. AVL tree implementation II-pl_PL.srt
7. AVL tree implementation II-en_US.srt
9. AVL tree implementation IV-en_US.srt
9. AVL tree implementation IV-pl_PL.srt
2. What are AVL trees-pl_PL.srt
2. What are AVL trees-en_US.srt
10. AVL tree implementation V-en_US.srt
10. AVL tree implementation V-pl_PL.srt
5. AVL trees introduction - illustration-pl_PL.srt
5. AVL trees introduction - illustration-en_US.srt
11. Practical (real-world) applications of balanced binary search trees-pl_PL.srt
1. Motivation behind balanced binary search trees-pl_PL.srt
1. Motivation behind balanced binary search trees-en_US.srt
11. Practical (real-world) applications of balanced binary search trees-en_US.srt
7. AVL tree implementation II.mp4
3. AVL trees introduction - height.mp4
6. AVL tree implementation I.mp4
4. AVL trees introduction - rotations.mp4
2. What are AVL trees.mp4
11. Practical (real-world) applications of balanced binary search trees.mp4
5. AVL trees introduction - illustration.mp4
1. Motivation behind balanced binary search trees.mp4
10. AVL tree implementation V.mp4
18. Data Structures - Associative Arrays (Dictionaries)
2. Hashtable introduction - basics-pl_PL.srt
3. Hashtable introduction - collisions-pl_PL.srt
3. Hashtable introduction - collisions-en_US.srt
2. Hashtable introduction - basics-en_US.srt
9. Practical (real-world) applications of hashing-th_TH.srt
4. Hashtable introduction - dynamic resizing-pl_PL.srt
4. Hashtable introduction - dynamic resizing-en_US.srt
9. Practical (real-world) applications of hashing-ro_RO.srt
9. Practical (real-world) applications of hashing-pl_PL.srt
9. Practical (real-world) applications of hashing-id_ID.srt
9. Practical (real-world) applications of hashing-en_US.srt
1. What are associative arrays-pl_PL.srt
5. Linear probing implementation I-en_US.srt
1. What are associative arrays-en_US.srt
5. Linear probing implementation I-pl_PL.srt
6. Linear probing implementation II-pl_PL.srt
6. Linear probing implementation II-en_US.srt
7. Linear probing implementation III-en_US.srt
8. Dictionaires in Python-pl_PL.srt
8. Dictionaires in Python-en_US.srt
6. Linear probing implementation II.mp4
7. Linear probing implementation III-pl_PL.srt
3. Hashtable introduction - collisions.mp4
2. Hashtable introduction - basics.mp4
4. Hashtable introduction - dynamic resizing.mp4
5. Linear probing implementation I.mp4
9. Practical (real-world) applications of hashing.mp4
1. What are associative arrays.mp4
7. Linear probing implementation III.mp4
8. Dictionaires in Python.mp4
1. Introduction
Complexity theory basics.html
1. Introduction-en_US.srt
1. Introduction-pl_PL.srt
1. Introduction.mp4
12. Data Structures - Binary Search Trees
10. Binary Search Tree implementation III-pl_PL.srt
10. Binary Search Tree implementation III-en_US.srt
1. What are binary search trees-pl_PL.srt
1. What are binary search trees-en_US.srt
7. Binary Search Tree implementation II-pl_PL.srt
7. Binary Search Tree implementation II-en_US.srt
2. Binary search trees theory - search, insert-pl_PL.srt
2. Binary search trees theory - search, insert-en_US.srt
6. Binary search tree implementation I-pl_PL.srt
6. Binary search tree implementation I-en_US.srt
3. Binary search trees theory - delete-en_US.srt
9. Stack memory visualization - tree traversal-en_US.srt
9. Stack memory visualization - tree traversal-pl_PL.srt
3. Binary search trees theory - delete-pl_PL.srt
4. Binary search trees theory - in-order traversal-pl_PL.srt
4. Binary search trees theory - in-order traversal-en_US.srt
11. Practical (real-world) applications of trees-th_TH.srt
10. Binary Search Tree implementation III.mp4
8. Stack memory visualization - finding max (min) items-pl_PL.srt
8. Stack memory visualization - finding max (min) items-en_US.srt
5. Binary search trees theory - running times-pl_PL.srt
5. Binary search trees theory - running times-en_US.srt
11. Practical (real-world) applications of trees-ro_RO.srt
11. Practical (real-world) applications of trees-pl_PL.srt
11. Practical (real-world) applications of trees-id_ID.srt
11. Practical (real-world) applications of trees-en_US.srt
1. What are binary search trees.mp4
7. Binary Search Tree implementation II.mp4
6. Binary search tree implementation I.mp4
9. Stack memory visualization - tree traversal.mp4
4. Binary search trees theory - in-order traversal.mp4
2. Binary search trees theory - search, insert.mp4
11. Practical (real-world) applications of trees.mp4
3. Binary search trees theory - delete.mp4
8. Stack memory visualization - finding max (min) items.mp4
5. Binary search trees theory - running times.mp4
21. Interview Questions (Graph Traversal)
3. Interview question #2 - solution-en_US.srt
3. Interview question #2 - solution-pl_PL.srt
3. Interview question #2 - solution.mp4
2. Depth-first search and stack memory visualisation-en_US.srt
2. Depth-first search and stack memory visualisation-pl_PL.srt
Interview question #1 - implement DFS with recursion.html
Interview question #2 - using BFS to find way out of maze.html
1. Interview question #1 - solution-pl_PL.srt
1. Interview question #1 - solution-en_US.srt
2. Depth-first search and stack memory visualisation.mp4
1. Interview question #1 - solution.mp4
25. Graph Algorithms - Spanning Trees with Kruskal Algorithm
1. What is the disjoint set data structure-pl_PL.srt
1. What is the disjoint set data structure-en_US.srt
5. Kruskal algorithm implementation II - disjoint set-pl_PL.srt
5. Kruskal algorithm implementation II - disjoint set-en_US.srt
3. Kruskal's algorithm introduction-pl_PL.srt
3. Kruskal's algorithm introduction-en_US.srt
2. Disjoint sets visualization-pl_PL.srt
2. Disjoint sets visualization-en_US.srt
4. Kruskal algorithm implementation I - basic classes-pl_PL.srt
4. Kruskal algorithm implementation I - basic classes-en_US.srt
5. Kruskal algorithm implementation II - disjoint set.mp4
6. Kruskal algorithm implementation III - algorithm-pl_PL.srt
6. Kruskal algorithm implementation III - algorithm-en_US.srt
7. Kruskal algorithm implementation VI - testing-pl_PL.srt
7. Kruskal algorithm implementation VI - testing-en_US.srt
3. Kruskal's algorithm introduction.mp4
1. What is the disjoint set data structure.mp4
6. Kruskal algorithm implementation III - algorithm.mp4
4. Kruskal algorithm implementation I - basic classes.mp4
7. Kruskal algorithm implementation VI - testing.mp4
2. Disjoint sets visualization.mp4
3. Installation and Environment Setup
Installing Python and PyCharm on Mac.html
Installing Python and PyCharm on Windows.html
27. Basic Sorting Algorithms
26. Radix sort implementation-pl_PL.srt
25. Radix sort introduction-pl_PL.srt
26. Radix sort implementation-en_US.srt
15. Quicksort introduction - example-th_TH.srt
25. Radix sort introduction-en_US.srt
14. Quicksort introduction-pl_PL.srt
14. Quicksort introduction-en_US.srt
15. Quicksort introduction - example-ro_RO.srt
16. Quicksort implementation-pl_PL.srt
16. Quicksort implementation-en_US.srt
23. Counting sort introduction-pl_PL.srt
23. Counting sort introduction-en_US.srt
24. Counting sort implementation-pl_PL.srt
5. Bogo sort implementation-en_US.srt
24. Counting sort implementation-en_US.srt
10. Insertion sort introduction-pl_PL.srt
10. Insertion sort introduction-en_US.srt
18. Merge sort introduction-pl_PL.srt
18. Merge sort introduction-en_US.srt
15. Quicksort introduction - example-id_ID.srt
20. Stack memory and merge sort visualization-en_US.srt
20. Stack memory and merge sort visualization-pl_PL.srt
1. Sorting introduction-pl_PL.srt
15. Quicksort introduction - example-pl_PL.srt
17. What is the worst-case scenario for quicksort-pl_PL.srt
1. Sorting introduction-en_US.srt
15. Quicksort introduction - example-en_US.srt
19. Merge sort implementation-en_US.srt
19. Merge sort implementation-pl_PL.srt
17. What is the worst-case scenario for quicksort-en_US.srt
5. Bogo sort implementation-pl_PL.srt
12. Shell sort introduction-pl_PL.srt
12. Shell sort introduction-en_US.srt
21. Hybrid algorithms introduction-pl_PL.srt
13. Shell sort implementation-pl_PL.srt
13. Shell sort implementation-en_US.srt
2. What is stability in sorting-pl_PL.srt
6. Bubble sort introduction-pl_PL.srt
21. Hybrid algorithms introduction-en_US.srt
2. What is stability in sorting-en_US.srt
8. Selection sort introduction-pl_PL.srt
6. Bubble sort introduction-en_US.srt
8. Selection sort introduction-en_US.srt
7. Bubble sort implementation-pl_PL.srt
7. Bubble sort implementation-en_US.srt
11. Insertion sort implementation-en_US.srt
11. Insertion sort implementation-pl_PL.srt
9. Selection sort implementation-pl_PL.srt
9. Selection sort implementation-en_US.srt
22. Non-comparison based algorithms-en_US.srt
4. Bogo sort introduction-pl_PL.srt
3. What is adaptive sorting-pl_PL.srt
4. Bogo sort introduction-en_US.srt
3. What is adaptive sorting-en_US.srt
22. Non-comparison based algorithms-pl_PL.srt
Hoare's partitioning and Lomuto's partitioning.html
Measure running time differences.html
Solution - sorting custom objects with insertion sort.html
Visualizing sorting algorithms with Algorhyme.html
Exercise - sorting custom objects with insertion sort.html
25. Radix sort introduction.mp4
26. Radix sort implementation.mp4
5. Bogo sort implementation.mp4
15. Quicksort introduction - example.mp4
16. Quicksort implementation.mp4
23. Counting sort introduction.mp4
14. Quicksort introduction.mp4
24. Counting sort implementation.mp4
8. Selection sort introduction.mp4
19. Merge sort implementation.mp4
1. Sorting introduction.mp4
10. Insertion sort introduction.mp4
18. Merge sort introduction.mp4
3. What is adaptive sorting.mp4
21. Hybrid algorithms introduction.mp4
20. Stack memory and merge sort visualization.mp4
17. What is the worst-case scenario for quicksort.mp4
2. What is stability in sorting.mp4
11. Insertion sort implementation.mp4
13. Shell sort implementation.mp4
7. Bubble sort implementation.mp4
9. Selection sort implementation.mp4
6. Bubble sort introduction.mp4
12. Shell sort introduction.mp4
4. Bogo sort introduction.mp4
22. Non-comparison based algorithms.mp4
23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm
1. What is the Bellman-Ford algorithm-pl_PL.srt
1. What is the Bellman-Ford algorithm-en_US.srt
3. Bellman-Ford algorithm implementation I - Node, Edge-pl_PL.srt
4. Bellman-Ford algorithm implementation II - the algorithm-pl_PL.srt
4. Bellman-Ford algorithm implementation II - the algorithm-en_US.srt
5. Bellman-Ford algorithm implementation III - testing-en_US.srt
6. Greedy algorithm or dynamic programming approach-pl_PL.srt
2. Bellman-Ford algorithm visualization-pl_PL.srt
6. Greedy algorithm or dynamic programming approach-en_US.srt
2. Bellman-Ford algorithm visualization-en_US.srt
5. Bellman-Ford algorithm implementation III - testing-pl_PL.srt
3. Bellman-Ford algorithm implementation I - Node, Edge-en_US.srt
4. Bellman-Ford algorithm implementation II - the algorithm.mp4
1. What is the Bellman-Ford algorithm.mp4
6. Greedy algorithm or dynamic programming approach.mp4
5. Bellman-Ford algorithm implementation III - testing.mp4
2. Bellman-Ford algorithm visualization.mp4
3. Bellman-Ford algorithm implementation I - Node, Edge.mp4
22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm
4. Dijkstra algorithm implementation II - algorithm-pl_PL.srt
6. Dijktsra's algorithm with adjacency matrix representation-pl_PL.srt
4. Dijkstra algorithm implementation II - algorithm-en_US.srt
7. Adjacency matrix representation implementation-pl_PL.srt
7. Adjacency matrix representation implementation-en_US.srt
6. Dijktsra's algorithm with adjacency matrix representation-en_US.srt
2. Dijkstra algorithm visualization-pl_PL.srt
2. Dijkstra algorithm visualization-en_US.srt
3. Dijkstra algorithm implementation I - Edge, Node-pl_PL.srt
3. Dijkstra algorithm implementation I - Edge, Node-en_US.srt
7. Adjacency matrix representation implementation.mp4
4. Dijkstra algorithm implementation II - algorithm.mp4
8. Shortest path algorithms applications-pl_PL.srt
8. Shortest path algorithms applications-en_US.srt
1. What is the shortest path problem-pl_PL.srt
1. What is the shortest path problem-en_US.srt
9. What is the critical path method (CPM)-pl_PL.srt
9. What is the critical path method (CPM)-en_US.srt
5. Dijkstra algorithm implementation III - testing-pl_PL.srt
5. Dijkstra algorithm implementation III - testing-en_US.srt
3. Dijkstra algorithm implementation I - Edge, Node.mp4
5. Dijkstra algorithm implementation III - testing.mp4
2. Dijkstra algorithm visualization.mp4
6. Dijktsra's algorithm with adjacency matrix representation.mp4
8. Shortest path algorithms applications.mp4
1. What is the shortest path problem.mp4
9. What is the critical path method (CPM).mp4
30. Course Materials (DOWNLOADS)
Download course materials (slides and source code).html
26. Graph Algorithms - Spanning Trees with Prims Algorithm
2. Prims-Jarnik algorithm implementation I.mp4
2. Prims-Jarnik algorithm implementation I-pl_PL.srt
1. What is the Prim-Jarnik algorithm-pl_PL.srt
2. Prims-Jarnik algorithm implementation I-en_US.srt
1. What is the Prim-Jarnik algorithm-en_US.srt
4. Applications of spanning trees-pl_PL.srt
4. Applications of spanning trees-en_US.srt
3. Prims-Jarnik algorithm implementation II-pl_PL.srt
3. Prims-Jarnik algorithm implementation II-en_US.srt
3. Prims-Jarnik algorithm implementation II.mp4
4. Applications of spanning trees.mp4
1. What is the Prim-Jarnik algorithm.mp4
11. Interview Questions (Stacks and Queues)
1. Max in a stack problem solution-th_TH.srt
2. Queue with stack problem solution-th_TH.srt
Max in a stack problem overview.html
Queue with stack problem.html
1. Max in a stack problem solution-id_ID.srt
1. Max in a stack problem solution-en_US.srt
1. Max in a stack problem solution-ro_RO.srt
1. Max in a stack problem solution-pl_PL.srt
3. Queue with stack problem solution - recursion-th_TH.srt
2. Queue with stack problem solution-ro_RO.srt
2. Queue with stack problem solution-id_ID.srt
2. Queue with stack problem solution-pl_PL.srt
2. Queue with stack problem solution-en_US.srt
3. Queue with stack problem solution - recursion-id_ID.srt
3. Queue with stack problem solution - recursion-ro_RO.srt
3. Queue with stack problem solution - recursion-pl_PL.srt
3. Queue with stack problem solution - recursion-en_US.srt
1. Max in a stack problem solution.mp4
3. Queue with stack problem solution - recursion.mp4
2. Queue with stack problem solution.mp4
6. Data Structures - Linked Lists
2. Linked list introduction - operations-pl_PL.srt
2. Linked list introduction - operations-en_US.srt
7. Practical (real-world) applications of linked lists-th_TH.srt
5. Linked list implementation III-pl_PL.srt
5. Linked list implementation III-en_US.srt
3. Linked list implementation I-pl_PL.srt
3. Linked list implementation I-en_US.srt
6. Comparing linked lists and arrays-pl_PL.srt
6. Comparing linked lists and arrays-en_US.srt
7. Practical (real-world) applications of linked lists-ro_RO.srt
7. Practical (real-world) applications of linked lists-pl_PL.srt
7. Practical (real-world) applications of linked lists-id_ID.srt
7. Practical (real-world) applications of linked lists-en_US.srt
1. What are linked lists-pl_PL.srt
1. What are linked lists-en_US.srt
4. Linked list implementation II-pl_PL.srt
4. Linked list implementation II-en_US.srt
7. Practical (real-world) applications of linked lists.mp4
2. Linked list introduction - operations.mp4
5. Linked list implementation III.mp4
3. Linked list implementation I.mp4
1. What are linked lists.mp4
4. Linked list implementation II.mp4
6. Comparing linked lists and arrays.mp4
5. Interview Questions (Arrays)
Anagram problem overview.html
Duplicates in an array problem overview.html
Integer reversion problem overview.html
Palindrome problem overview.html
Reversing an array in-place overview.html
3. Integer reversion problem solution-pl_PL.srt
3. Integer reversion problem solution-en_US.srt
5. Duplicates in an array problem solution-pl_PL.srt
5. Duplicates in an array problem solution-en_US.srt
2. Palindrome problem solution-en_US.srt
2. Palindrome problem solution-pl_PL.srt
4. Anagram problem solution-en_US.srt
4. Anagram problem solution-pl_PL.srt
1. Reversing an array in-place solution-en_US.srt
1. Reversing an array in-place solution-pl_PL.srt
5. Duplicates in an array problem solution.mp4
2. Palindrome problem solution.mp4
3. Integer reversion problem solution.mp4
4. Anagram problem solution.mp4
1. Reversing an array in-place solution.mp4
15. Data Structures - Red-Black Trees
1. What are red-black trees-pl_PL.srt
1. What are red-black trees-en_US.srt
7. Red-black tree implementation III-pl_PL.srt
7. Red-black tree implementation III-en_US.srt
3. Red-black trees - recoloring and rotation cases-pl_PL.srt
3. Red-black trees - recoloring and rotation cases-en_US.srt
4. Red-black tree illustrations-pl_PL.srt
4. Red-black tree illustrations-en_US.srt
5. Red-black tree implementation I-pl_PL.srt
5. Red-black tree implementation I-en_US.srt
7. Red-black tree implementation III.mp4
2. The logic behind red-black trees-pl_PL.srt
2. The logic behind red-black trees-en_US.srt
6. Red-black tree implementation II-pl_PL.srt
6. Red-black tree implementation II-en_US.srt
8. Red-black tree implementation IV-pl_PL.srt
9. Differences between red-black tree and AVL trees-pl_PL.srt
9. Differences between red-black tree and AVL trees-en_US.srt
8. Red-black tree implementation IV-en_US.srt
1. What are red-black trees.mp4
3. Red-black trees - recoloring and rotation cases.mp4
2. The logic behind red-black trees.mp4
5. Red-black tree implementation I.mp4
8. Red-black tree implementation IV.mp4
6. Red-black tree implementation II.mp4
4. Red-black tree illustrations.mp4
9. Differences between red-black tree and AVL trees.mp4
8. Interview Questions (Linked Lists)
2. Reverse a linked list in-place solution-th_TH.srt
Reverse a linked list in-place overview.html
2. Reverse a linked list in-place solution-id_ID.srt
2. Reverse a linked list in-place solution-ro_RO.srt
2. Reverse a linked list in-place solution-en_US.srt
2. Reverse a linked list in-place solution-pl_PL.srt
1. Finding the middle node in a linked list solution-pl_PL.srt
1. Finding the middle node in a linked list solution-en_US.srt
Finding the middle node in a linked list overview.html
2. Reverse a linked list in-place solution.mp4
1. Finding the middle node in a linked list solution.mp4
16. Data Structures - Heaps
2. Heap introduction - basics-pl_PL.srt
2. Heap introduction - basics-en_US.srt
9. Heap implementation II-pl_PL.srt
3. Heap introduction - array representation-pl_PL.srt
9. Heap implementation II-en_US.srt
3. Heap introduction - array representation-en_US.srt
6. Heap introduction - operations complexities-th_TH.srt
4. Heap introduction - remove operation-pl_PL.srt
6. Heap introduction - operations complexities-en_US.srt
9. Heap implementation II.mp4
4. Heap introduction - remove operation-en_US.srt
5. Using heap data structure to sort (heapsort)-pl_PL.srt
5. Using heap data structure to sort (heapsort)-en_US.srt
6. Heap introduction - operations complexities-ro_RO.srt
6. Heap introduction - operations complexities-pl_PL.srt
6. Heap introduction - operations complexities-id_ID.srt
8. Heap implementation I-pl_PL.srt
8. Heap implementation I-en_US.srt
1. What are priority queues-pl_PL.srt
1. What are priority queues-en_US.srt
7. Binomial and Fibonacci heaps-pl_PL.srt
7. Binomial and Fibonacci heaps-en_US.srt
10. Heap implementation III-en_US.srt
10. Heap implementation III-pl_PL.srt
11. Heaps in Python-pl_PL.srt
11. Heaps in Python-en_US.srt
6. Heap introduction - operations complexities.mp4
10. Heap implementation III.mp4
2. Heap introduction - basics.mp4
3. Heap introduction - array representation.mp4
8. Heap implementation I.mp4
7. Binomial and Fibonacci heaps.mp4
4. Heap introduction - remove operation.mp4
1. What are priority queues.mp4
5. Using heap data structure to sort (heapsort).mp4
11. Heaps in Python.mp4
20. Graph Algorithms - Graph Traversal Algorithms
5. Depth-first search introduction-pl_PL.srt
5. Depth-first search introduction-en_US.srt
1. Breadth-first search introduction-pl_PL.srt
1. Breadth-first search introduction-en_US.srt
4. WebCrawler basic implementation-en_US.srt
4. WebCrawler basic implementation-pl_PL.srt
7. Memory management BFS vs DFS-th_TH.srt
2. Breadth-first search implementation-pl_PL.srt
2. Breadth-first search implementation-en_US.srt
6. Depth-first search implementation-pl_PL.srt
3. What are WebCrawlers (core of search engines)-pl_PL.srt
6. Depth-first search implementation-en_US.srt
3. What are WebCrawlers (core of search engines)-en_US.srt
7. Memory management BFS vs DFS-ro_RO.srt
7. Memory management BFS vs DFS-id_ID.srt
7. Memory management BFS vs DFS-pl_PL.srt
7. Memory management BFS vs DFS-en_US.srt
Depth-first search implementation II.html
4. WebCrawler basic implementation.mp4
1. Breadth-first search introduction.mp4
3. What are WebCrawlers (core of search engines).mp4
5. Depth-first search introduction.mp4
7. Memory management BFS vs DFS.mp4
2. Breadth-first search implementation.mp4
6. Depth-first search implementation.mp4
4. Data Structures - Arrays
3. Arrays in Python-pl_PL.srt
3. Arrays in Python-en_US.srt
2. Arrays introduction - operations-pl_PL.srt
2. Arrays introduction - operations-en_US.srt
1. What are array data structures-pl_PL.srt
1. What are array data structures-en_US.srt
4. What are real arrays in Python-pl_PL.srt
4. What are real arrays in Python-en_US.srt
3. Arrays in Python.mp4
1. What are array data structures.mp4
2. Arrays introduction - operations.mp4
4. What are real arrays in Python.mp4
9. Data Structures - Stacks
4. Stack implementation-en_US.srt
4. Stack implementation-pl_PL.srt
3. Stack memory visualization-en_US.srt
3. Stack memory visualization-pl_PL.srt
5. Practical (real-world) applications of stacks-th_TH.srt
1. What are stacks-pl_PL.srt
1. What are stacks-en_US.srt
2. Stacks in memory management (stacks and heaps )-pl_PL.srt
2. Stacks in memory management (stacks and heaps )-en_US.srt
5. Practical (real-world) applications of stacks-ro_RO.srt
5. Practical (real-world) applications of stacks-id_ID.srt
5. Practical (real-world) applications of stacks-pl_PL.srt
5. Practical (real-world) applications of stacks-en_US.srt
4. Stack implementation.mp4
3. Stack memory visualization.mp4
5. Practical (real-world) applications of stacks.mp4
1. What are stacks.mp4
2. Stacks in memory management (stacks and heaps ).mp4
10. Data Structures - Queues
2. Queue implementation-en_US.srt
2. Queue implementation-pl_PL.srt
1. What are queues-pl_PL.srt
1. What are queues-en_US.srt
2. Queue implementation.mp4
1. What are queues.mp4
7. Data Structures - Doubly Linked Lists
2. Doubly linked list implementation-pl_PL.srt
2. Doubly linked list implementation-en_US.srt
1. What are doubly linked lists-pl_PL.srt
1. What are doubly linked lists-en_US.srt
3. Running time comparison linked lists and arrays-pl_PL.srt
3. Running time comparison linked lists and arrays-en_US.srt
2. Doubly linked list implementation.mp4
1. What are doubly linked lists.mp4
3. Running time comparison linked lists and arrays.mp4
13. Interview Questions (Binary Search Trees)
1. Compare binary trees solution-th_TH.srt
Compare binary trees overview.html
1. Compare binary trees solution-ro_RO.srt
1. Compare binary trees solution-id_ID.srt
1. Compare binary trees solution-pl_PL.srt
1. Compare binary trees solution-en_US.srt
1. Compare binary trees solution.mp4
17. Interview Questions (Heaps)
Interview question #1 - checking heap properties.html
2. Interview question #2 - solution-en_US.srt
2. Interview question #2 - solution-pl_PL.srt
1. Interview question #1 - solution-pl_PL.srt
1. Interview question #1 - solution-en_US.srt
Interview question #2 - max heap to a min heap.html
2. Interview question #2 - solution.mp4
1. Interview question #1 - solution.mp4
24. Interview Questions (Shortest Paths)
1. How to use Bellman-Ford algorithm on the FOREX-en_US.srt
1. How to use Bellman-Ford algorithm on the FOREX-pl_PL.srt
2. Interview question #1 - solution-en_US.srt
2. Interview question #1 - solution-pl_PL.srt
Interview question #1 - detecting negative cycles on the FOREX.html
2. Interview question #1 - solution.mp4
1. How to use Bellman-Ford algorithm on the FOREX.mp4
19. Graph Algorithms Overview
2. Adjacency matrix and adjacency list-pl_PL.srt
2. Adjacency matrix and adjacency list-en_US.srt
3. Applications of graphs-pl_PL.srt
3. Applications of graphs-en_US.srt
1. Graph theory overview-pl_PL.srt
1. Graph theory overview-en_US.srt
2. Adjacency matrix and adjacency list.mp4
3. Applications of graphs.mp4
1. Graph theory overview.mp4
2. Data Structures Overview
1. Why to use data structures-pl_PL.srt
1. Why to use data structures-en_US.srt
2. Data structures and abstract data types-en_US.srt
2. Data structures and abstract data types-pl_PL.srt
1. Why to use data structures.mp4
2. Data structures and abstract data types.mp4
28. Interview Questions (Sorting)
Interview question #1 - solution.html
Interview question #3 - solution.html
Interview question #2 - solution.html
Interview question #2 - implement quicksort with iteration.html
Interview question #1 - implementing TimSort algorithm.html
Interview question #3 - implementing selection sort with recursion.html
29. Next Steps
Next steps.html
.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
TutsNode.com.txt
[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 Algorithms and Data Structures in Python (INTERVIEW Q&A) Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
