Algorithms and Data Structures in Python INTERVIEW | 31691FFF2D6A91F8E847C86C857AE1153C93F5FD

Algorithms and Data Structures in Python INTERVIEW

Name	Algorithms and Data Structures in Python (INTERVIEW Q&A)	DOWNLOAD Copy Link
Total Size	4.5 GB
Total Files	693
Last Seen	2024-07-08 23:44
Hash	31691FFF2D6A91F8E847C86C857AE1153C93F5FD

/.../31. Algorhyme FREE Algorithms Visualizer App/
1. Algorithms Visualization App-en_US.srt	0.0 KB
Algorhyme - Algorithms and Data Structures.html	2.0 KB
1. Algorithms Visualization App.mp4	7.8 MB
/.../14. Data Structures - AVL Trees/
9. AVL tree implementation IV.mp4	136.3 MB
8. AVL tree implementation III.mp4	101.2 MB
3. AVL trees introduction - height-pl_PL.srt	18.2 KB
3. AVL trees introduction - height-en_US.srt	17.6 KB
8. AVL tree implementation III-pl_PL.srt	17.1 KB
8. AVL tree implementation III-en_US.srt	16.7 KB
4. AVL trees introduction - rotations-pl_PL.srt	13.0 KB
6. AVL tree implementation I-pl_PL.srt	12.9 KB
4. AVL trees introduction - rotations-en_US.srt	12.8 KB
6. AVL tree implementation I-en_US.srt	12.7 KB
7. AVL tree implementation II-pl_PL.srt	11.9 KB
7. AVL tree implementation II-en_US.srt	11.5 KB
9. AVL tree implementation IV-en_US.srt	11.1 KB
9. AVL tree implementation IV-pl_PL.srt	11.0 KB
2. What are AVL trees-pl_PL.srt	9.4 KB
2. What are AVL trees-en_US.srt	9.2 KB
10. AVL tree implementation V-en_US.srt	3.0 KB
10. AVL tree implementation V-pl_PL.srt	3.0 KB
5. AVL trees introduction - illustration-pl_PL.srt	7.4 KB
5. AVL trees introduction - illustration-en_US.srt	7.4 KB
11. Practical (real-world) applications of balanced binary search trees-pl_PL.srt	5.2 KB
1. Motivation behind balanced binary search trees-pl_PL.srt	4.9 KB
1. Motivation behind balanced binary search trees-en_US.srt	4.8 KB
11. Practical (real-world) applications of balanced binary search trees-en_US.srt	4.8 KB
7. AVL tree implementation II.mp4	43.9 MB
3. AVL trees introduction - height.mp4	40.8 MB
6. AVL tree implementation I.mp4	29.0 MB
4. AVL trees introduction - rotations.mp4	23.6 MB
2. What are AVL trees.mp4	17.1 MB
11. Practical (real-world) applications of balanced binary search trees.mp4	16.2 MB
5. AVL trees introduction - illustration.mp4	9.5 MB
1. Motivation behind balanced binary search trees.mp4	8.6 MB
10. AVL tree implementation V.mp4	7.4 MB
/.../18. Data Structures - Associative Arrays (Dictionaries)/
2. Hashtable introduction - basics-pl_PL.srt	15.2 KB
3. Hashtable introduction - collisions-pl_PL.srt	15.5 KB
3. Hashtable introduction - collisions-en_US.srt	15.2 KB
2. Hashtable introduction - basics-en_US.srt	14.9 KB
9. Practical (real-world) applications of hashing-th_TH.srt	14.1 KB
4. Hashtable introduction - dynamic resizing-pl_PL.srt	10.1 KB
4. Hashtable introduction - dynamic resizing-en_US.srt	9.4 KB
9. Practical (real-world) applications of hashing-ro_RO.srt	8.6 KB
9. Practical (real-world) applications of hashing-pl_PL.srt	8.4 KB
9. Practical (real-world) applications of hashing-id_ID.srt	8.4 KB
9. Practical (real-world) applications of hashing-en_US.srt	8.2 KB
1. What are associative arrays-pl_PL.srt	8.1 KB
5. Linear probing implementation I-en_US.srt	7.9 KB
1. What are associative arrays-en_US.srt	7.8 KB
5. Linear probing implementation I-pl_PL.srt	7.8 KB
6. Linear probing implementation II-pl_PL.srt	7.4 KB
6. Linear probing implementation II-en_US.srt	7.3 KB
7. Linear probing implementation III-en_US.srt	2.9 KB
8. Dictionaires in Python-pl_PL.srt	4.5 KB
8. Dictionaires in Python-en_US.srt	4.5 KB
6. Linear probing implementation II.mp4	58.3 MB
7. Linear probing implementation III-pl_PL.srt	3.1 KB
3. Hashtable introduction - collisions.mp4	50.9 MB
2. Hashtable introduction - basics.mp4	44.4 MB
4. Hashtable introduction - dynamic resizing.mp4	35.7 MB
5. Linear probing implementation I.mp4	25.8 MB
9. Practical (real-world) applications of hashing.mp4	21.9 MB
1. What are associative arrays.mp4	18.9 MB
7. Linear probing implementation III.mp4	13.2 MB
8. Dictionaires in Python.mp4	12.1 MB
/.pad/
0	0.0 KB
1	0.0 KB
2	0.0 KB
3	0.0 KB
4	0.0 KB
5	0.0 KB
6	0.0 KB
7	0.0 KB
8	0.0 KB
9	0.1 KB
10	355.3 KB
11	908.6 KB
12	524.3 KB
13	607.2 KB
14	493.6 KB
15	276.5 KB
16	476.5 KB
17	639.3 KB
18	866.7 KB
19	686.9 KB
20	144.6 KB
21	529.4 KB
22	735.7 KB
23	151.8 KB
24	465.7 KB
25	531.4 KB
26	63.8 KB
27	742.1 KB
28	830.3 KB
29	941.3 KB
30	279.4 KB
31	568.3 KB
32	580.8 KB
33	427.8 KB
34	508.6 KB
35	613.5 KB
36	862.5 KB
37	1.0 MB
38	1.5 KB
39	614.4 KB
40	1.0 MB
41	376.9 KB
42	470.3 KB
43	647.5 KB
44	796.3 KB
45	504.8 KB
46	962.1 KB
47	150.8 KB
48	254.6 KB
49	352.2 KB
50	529.2 KB
51	574.9 KB
52	833.6 KB
53	601.7 KB
54	924.9 KB
55	297.0 KB
56	376.5 KB
57	527.9 KB
58	753.4 KB
59	77.1 KB
60	262.5 KB
61	359.8 KB
62	430.2 KB
63	662.9 KB
64	700.7 KB
65	955.6 KB
66	2.2 KB
67	47.6 KB
68	331.3 KB
69	399.8 KB
70	740.7 KB
71	203.4 KB
72	506.8 KB
73	257.5 KB
74	325.1 KB
75	389.4 KB
76	532.8 KB
77	679.4 KB
78	839.9 KB
79	1.0 MB
80	89.5 KB
81	165.0 KB
82	575.3 KB
83	776.6 KB
84	305.9 KB
85	454.0 KB
86	465.3 KB
87	612.6 KB
88	934.1 KB
89	963.1 KB
90	19.6 KB
91	100.7 KB
92	147.5 KB
93	464.0 KB
94	515.6 KB
95	546.9 KB
96	565.9 KB
97	870.5 KB
98	1.0 MB
99	10.7 KB
100	21.5 KB
101	46.8 KB
102	56.7 KB
103	890.5 KB
104	967.7 KB
105	163.1 KB
106	491.6 KB
107	529.5 KB
108	676.0 KB
109	788.8 KB
110	835.6 KB
111	930.8 KB
112	159.5 KB
113	572.4 KB
114	681.7 KB
115	955.8 KB
116	1.0 MB
117	305.4 KB
118	563.7 KB
119	607.6 KB
120	643.2 KB
121	810.7 KB
122	838.0 KB
123	848.8 KB
124	312.0 KB
125	350.3 KB
126	846.0 KB
127	13.2 KB
128	173.1 KB
129	202.2 KB
130	273.1 KB
131	275.6 KB
132	283.5 KB
133	418.3 KB
134	479.1 KB
135	709.6 KB
136	56.5 KB
137	64.1 KB
138	220.4 KB
139	433.7 KB
140	310.6 KB
141	453.7 KB
142	459.7 KB
143	482.7 KB
144	800.2 KB
145	185.7 KB
146	937.9 KB
147	110.4 KB
148	854.0 KB
149	151.5 KB
150	304.2 KB
151	586.6 KB
152	627.2 KB
153	971.2 KB
154	543.3 KB
/1. Introduction/
Complexity theory basics.html	0.4 KB
1. Introduction-en_US.srt	4.0 KB
1. Introduction-pl_PL.srt	4.0 KB
1. Introduction.mp4	18.9 MB
/.../12. Data Structures - Binary Search Trees/
10. Binary Search Tree implementation III-pl_PL.srt	21.8 KB
10. Binary Search Tree implementation III-en_US.srt	21.2 KB
1. What are binary search trees-pl_PL.srt	21.0 KB
1. What are binary search trees-en_US.srt	19.8 KB
7. Binary Search Tree implementation II-pl_PL.srt	14.3 KB
7. Binary Search Tree implementation II-en_US.srt	13.8 KB
2. Binary search trees theory - search, insert-pl_PL.srt	11.8 KB
2. Binary search trees theory - search, insert-en_US.srt	11.1 KB
6. Binary search tree implementation I-pl_PL.srt	10.4 KB
6. Binary search tree implementation I-en_US.srt	10.3 KB
3. Binary search trees theory - delete-en_US.srt	8.4 KB
9. Stack memory visualization - tree traversal-en_US.srt	8.6 KB
9. Stack memory visualization - tree traversal-pl_PL.srt	8.6 KB
3. Binary search trees theory - delete-pl_PL.srt	8.6 KB
4. Binary search trees theory - in-order traversal-pl_PL.srt	8.2 KB
4. Binary search trees theory - in-order traversal-en_US.srt	7.7 KB
11. Practical (real-world) applications of trees-th_TH.srt	7.3 KB
10. Binary Search Tree implementation III.mp4	75.3 MB
8. Stack memory visualization - finding max (min) items-pl_PL.srt	6.8 KB
8. Stack memory visualization - finding max (min) items-en_US.srt	6.7 KB
5. Binary search trees theory - running times-pl_PL.srt	6.6 KB
5. Binary search trees theory - running times-en_US.srt	6.3 KB
11. Practical (real-world) applications of trees-ro_RO.srt	4.3 KB
11. Practical (real-world) applications of trees-pl_PL.srt	4.0 KB
11. Practical (real-world) applications of trees-id_ID.srt	4.0 KB
11. Practical (real-world) applications of trees-en_US.srt	3.9 KB
1. What are binary search trees.mp4	43.5 MB
7. Binary Search Tree implementation II.mp4	37.1 MB
6. Binary search tree implementation I.mp4	26.3 MB
9. Stack memory visualization - tree traversal.mp4	18.0 MB
4. Binary search trees theory - in-order traversal.mp4	15.1 MB
2. Binary search trees theory - search, insert.mp4	13.8 MB
11. Practical (real-world) applications of trees.mp4	13.5 MB
3. Binary search trees theory - delete.mp4	13.3 MB
8. Stack memory visualization - finding max (min) items.mp4	12.4 MB
5. Binary search trees theory - running times.mp4	7.8 MB
/.../21. Interview Questions (Graph Traversal)/
3. Interview question #2 - solution-en_US.srt	20.8 KB
3. Interview question #2 - solution-pl_PL.srt	20.6 KB
3. Interview question #2 - solution.mp4	83.3 MB
2. Depth-first search and stack memory visualisation-en_US.srt	8.5 KB
2. Depth-first search and stack memory visualisation-pl_PL.srt	8.5 KB
Interview question #1 - implement DFS with recursion.html	0.3 KB
Interview question #2 - using BFS to find way out of maze.html	0.7 KB
1. Interview question #1 - solution-pl_PL.srt	4.1 KB
1. Interview question #1 - solution-en_US.srt	4.0 KB
2. Depth-first search and stack memory visualisation.mp4	14.3 MB
1. Interview question #1 - solution.mp4	10.3 MB
/.../25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/
1. What is the disjoint set data structure-pl_PL.srt	20.5 KB
1. What is the disjoint set data structure-en_US.srt	19.9 KB
5. Kruskal algorithm implementation II - disjoint set-pl_PL.srt	17.1 KB
5. Kruskal algorithm implementation II - disjoint set-en_US.srt	16.8 KB
3. Kruskal's algorithm introduction-pl_PL.srt	14.4 KB
3. Kruskal's algorithm introduction-en_US.srt	13.9 KB
2. Disjoint sets visualization-pl_PL.srt	8.3 KB
2. Disjoint sets visualization-en_US.srt	8.2 KB
4. Kruskal algorithm implementation I - basic classes-pl_PL.srt	8.1 KB
4. Kruskal algorithm implementation I - basic classes-en_US.srt	8.0 KB
5. Kruskal algorithm implementation II - disjoint set.mp4	65.7 MB
6. Kruskal algorithm implementation III - algorithm-pl_PL.srt	6.5 KB
6. Kruskal algorithm implementation III - algorithm-en_US.srt	6.4 KB
7. Kruskal algorithm implementation VI - testing-pl_PL.srt	4.6 KB
7. Kruskal algorithm implementation VI - testing-en_US.srt	4.5 KB
3. Kruskal's algorithm introduction.mp4	57.8 MB
1. What is the disjoint set data structure.mp4	41.5 MB
6. Kruskal algorithm implementation III - algorithm.mp4	23.9 MB
4. Kruskal algorithm implementation I - basic classes.mp4	20.7 MB
7. Kruskal algorithm implementation VI - testing.mp4	17.0 MB
2. Disjoint sets visualization.mp4	11.1 MB
/.../3. Installation and Environment Setup/
Installing Python and PyCharm on Mac.html	1.2 KB
Installing Python and PyCharm on Windows.html	1.3 KB
/.../27. Basic Sorting Algorithms/
26. Radix sort implementation-pl_PL.srt	19.2 KB
25. Radix sort introduction-pl_PL.srt	19.1 KB
26. Radix sort implementation-en_US.srt	19.0 KB
15. Quicksort introduction - example-th_TH.srt	18.2 KB
25. Radix sort introduction-en_US.srt	18.2 KB
14. Quicksort introduction-pl_PL.srt	17.3 KB
14. Quicksort introduction-en_US.srt	17.0 KB
15. Quicksort introduction - example-ro_RO.srt	11.2 KB
16. Quicksort implementation-pl_PL.srt	15.0 KB
16. Quicksort implementation-en_US.srt	14.9 KB
23. Counting sort introduction-pl_PL.srt	14.5 KB
23. Counting sort introduction-en_US.srt	14.0 KB
24. Counting sort implementation-pl_PL.srt	13.1 KB
5. Bogo sort implementation-en_US.srt	9.8 KB
24. Counting sort implementation-en_US.srt	13.1 KB
10. Insertion sort introduction-pl_PL.srt	12.9 KB
10. Insertion sort introduction-en_US.srt	12.6 KB
18. Merge sort introduction-pl_PL.srt	12.1 KB
18. Merge sort introduction-en_US.srt	11.7 KB
15. Quicksort introduction - example-id_ID.srt	11.1 KB
20. Stack memory and merge sort visualization-en_US.srt	11.1 KB
20. Stack memory and merge sort visualization-pl_PL.srt	11.0 KB
1. Sorting introduction-pl_PL.srt	10.8 KB
15. Quicksort introduction - example-pl_PL.srt	10.6 KB
17. What is the worst-case scenario for quicksort-pl_PL.srt	10.6 KB
1. Sorting introduction-en_US.srt	10.4 KB
15. Quicksort introduction - example-en_US.srt	10.3 KB
19. Merge sort implementation-en_US.srt	10.3 KB
19. Merge sort implementation-pl_PL.srt	10.2 KB
17. What is the worst-case scenario for quicksort-en_US.srt	10.2 KB
5. Bogo sort implementation-pl_PL.srt	9.8 KB
12. Shell sort introduction-pl_PL.srt	8.8 KB
12. Shell sort introduction-en_US.srt	8.6 KB
21. Hybrid algorithms introduction-pl_PL.srt	8.5 KB
13. Shell sort implementation-pl_PL.srt	8.3 KB
13. Shell sort implementation-en_US.srt	8.3 KB
2. What is stability in sorting-pl_PL.srt	8.2 KB
6. Bubble sort introduction-pl_PL.srt	8.2 KB
21. Hybrid algorithms introduction-en_US.srt	8.2 KB
2. What is stability in sorting-en_US.srt	8.1 KB
8. Selection sort introduction-pl_PL.srt	7.8 KB
6. Bubble sort introduction-en_US.srt	7.6 KB
8. Selection sort introduction-en_US.srt	7.3 KB
7. Bubble sort implementation-pl_PL.srt	7.2 KB
7. Bubble sort implementation-en_US.srt	7.2 KB
11. Insertion sort implementation-en_US.srt	7.1 KB
11. Insertion sort implementation-pl_PL.srt	7.0 KB
9. Selection sort implementation-pl_PL.srt	6.9 KB
9. Selection sort implementation-en_US.srt	6.8 KB
22. Non-comparison based algorithms-en_US.srt	3.0 KB
4. Bogo sort introduction-pl_PL.srt	4.7 KB
3. What is adaptive sorting-pl_PL.srt	4.5 KB
4. Bogo sort introduction-en_US.srt	4.5 KB
3. What is adaptive sorting-en_US.srt	4.3 KB
22. Non-comparison based algorithms-pl_PL.srt	3.1 KB
Hoare's partitioning and Lomuto's partitioning.html	1.6 KB
Measure running time differences.html	1.1 KB
Solution - sorting custom objects with insertion sort.html	1.1 KB
Visualizing sorting algorithms with Algorhyme.html	0.7 KB
Exercise - sorting custom objects with insertion sort.html	0.4 KB
25. Radix sort introduction.mp4	53.0 MB
26. Radix sort implementation.mp4	50.1 MB
5. Bogo sort implementation.mp4	48.8 MB
15. Quicksort introduction - example.mp4	43.3 MB
16. Quicksort implementation.mp4	40.1 MB
23. Counting sort introduction.mp4	37.2 MB
14. Quicksort introduction.mp4	35.7 MB
24. Counting sort implementation.mp4	33.6 MB
8. Selection sort introduction.mp4	31.5 MB
19. Merge sort implementation.mp4	28.6 MB
1. Sorting introduction.mp4	27.0 MB
10. Insertion sort introduction.mp4	23.7 MB
18. Merge sort introduction.mp4	20.5 MB
3. What is adaptive sorting.mp4	20.4 MB
21. Hybrid algorithms introduction.mp4	20.0 MB
20. Stack memory and merge sort visualization.mp4	19.5 MB
17. What is the worst-case scenario for quicksort.mp4	19.4 MB
2. What is stability in sorting.mp4	17.9 MB
11. Insertion sort implementation.mp4	16.1 MB
13. Shell sort implementation.mp4	15.8 MB
7. Bubble sort implementation.mp4	15.4 MB
9. Selection sort implementation.mp4	14.9 MB
6. Bubble sort introduction.mp4	13.2 MB
12. Shell sort introduction.mp4	12.5 MB
4. Bogo sort introduction.mp4	8.1 MB
22. Non-comparison based algorithms.mp4	5.7 MB
/.../23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/
1. What is the Bellman-Ford algorithm-pl_PL.srt	18.6 KB
1. What is the Bellman-Ford algorithm-en_US.srt	18.0 KB
3. Bellman-Ford algorithm implementation I - Node, Edge-pl_PL.srt	2.2 KB
4. Bellman-Ford algorithm implementation II - the algorithm-pl_PL.srt	9.5 KB
4. Bellman-Ford algorithm implementation II - the algorithm-en_US.srt	9.1 KB
5. Bellman-Ford algorithm implementation III - testing-en_US.srt	4.3 KB
6. Greedy algorithm or dynamic programming approach-pl_PL.srt	8.2 KB
2. Bellman-Ford algorithm visualization-pl_PL.srt	7.8 KB
6. Greedy algorithm or dynamic programming approach-en_US.srt	7.7 KB
2. Bellman-Ford algorithm visualization-en_US.srt	7.3 KB
5. Bellman-Ford algorithm implementation III - testing-pl_PL.srt	4.3 KB
3. Bellman-Ford algorithm implementation I - Node, Edge-en_US.srt	2.1 KB
4. Bellman-Ford algorithm implementation II - the algorithm.mp4	52.9 MB
1. What is the Bellman-Ford algorithm.mp4	45.5 MB
6. Greedy algorithm or dynamic programming approach.mp4	35.8 MB
5. Bellman-Ford algorithm implementation III - testing.mp4	20.5 MB
2. Bellman-Ford algorithm visualization.mp4	11.2 MB
3. Bellman-Ford algorithm implementation I - Node, Edge.mp4	5.1 MB
/.../22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/
4. Dijkstra algorithm implementation II - algorithm-pl_PL.srt	17.4 KB
6. Dijktsra's algorithm with adjacency matrix representation-pl_PL.srt	17.0 KB
4. Dijkstra algorithm implementation II - algorithm-en_US.srt	16.9 KB
7. Adjacency matrix representation implementation-pl_PL.srt	16.7 KB
7. Adjacency matrix representation implementation-en_US.srt	16.0 KB
6. Dijktsra's algorithm with adjacency matrix representation-en_US.srt	15.9 KB
2. Dijkstra algorithm visualization-pl_PL.srt	15.0 KB
2. Dijkstra algorithm visualization-en_US.srt	14.4 KB
3. Dijkstra algorithm implementation I - Edge, Node-pl_PL.srt	14.1 KB
3. Dijkstra algorithm implementation I - Edge, Node-en_US.srt	13.6 KB
7. Adjacency matrix representation implementation.mp4	82.7 MB
4. Dijkstra algorithm implementation II - algorithm.mp4	77.4 MB
8. Shortest path algorithms applications-pl_PL.srt	7.2 KB
8. Shortest path algorithms applications-en_US.srt	7.0 KB
1. What is the shortest path problem-pl_PL.srt	6.7 KB
1. What is the shortest path problem-en_US.srt	6.5 KB
9. What is the critical path method (CPM)-pl_PL.srt	6.0 KB
9. What is the critical path method (CPM)-en_US.srt	5.6 KB
5. Dijkstra algorithm implementation III - testing-pl_PL.srt	5.0 KB
5. Dijkstra algorithm implementation III - testing-en_US.srt	4.9 KB
3. Dijkstra algorithm implementation I - Edge, Node.mp4	40.0 MB
5. Dijkstra algorithm implementation III - testing.mp4	38.2 MB
2. Dijkstra algorithm visualization.mp4	29.8 MB
6. Dijktsra's algorithm with adjacency matrix representation.mp4	25.5 MB
8. Shortest path algorithms applications.mp4	19.4 MB
1. What is the shortest path problem.mp4	14.9 MB
9. What is the critical path method (CPM).mp4	14.4 MB
/.../30. Course Materials (DOWNLOADS)/
Download course materials (slides and source code).html	0.0 KB
/.../26. Graph Algorithms - Spanning Trees with Prims Algorithm/
2. Prims-Jarnik algorithm implementation I.mp4	87.4 MB
2. Prims-Jarnik algorithm implementation I-pl_PL.srt	13.3 KB
1. What is the Prim-Jarnik algorithm-pl_PL.srt	13.0 KB
2. Prims-Jarnik algorithm implementation I-en_US.srt	13.0 KB
1. What is the Prim-Jarnik algorithm-en_US.srt	12.7 KB
4. Applications of spanning trees-pl_PL.srt	8.6 KB
4. Applications of spanning trees-en_US.srt	8.3 KB
3. Prims-Jarnik algorithm implementation II-pl_PL.srt	4.3 KB
3. Prims-Jarnik algorithm implementation II-en_US.srt	4.2 KB
3. Prims-Jarnik algorithm implementation II.mp4	33.2 MB
4. Applications of spanning trees.mp4	30.9 MB
1. What is the Prim-Jarnik algorithm.mp4	26.8 MB
/.../11. Interview Questions (Stacks and Queues)/
1. Max in a stack problem solution-th_TH.srt	16.2 KB
2. Queue with stack problem solution-th_TH.srt	13.2 KB
Max in a stack problem overview.html	0.3 KB
Queue with stack problem.html	0.1 KB
1. Max in a stack problem solution-id_ID.srt	9.3 KB
1. Max in a stack problem solution-en_US.srt	9.3 KB
1. Max in a stack problem solution-ro_RO.srt	9.2 KB
1. Max in a stack problem solution-pl_PL.srt	9.2 KB
3. Queue with stack problem solution - recursion-th_TH.srt	8.5 KB
2. Queue with stack problem solution-ro_RO.srt	8.1 KB
2. Queue with stack problem solution-id_ID.srt	8.0 KB
2. Queue with stack problem solution-pl_PL.srt	7.9 KB
2. Queue with stack problem solution-en_US.srt	7.5 KB
3. Queue with stack problem solution - recursion-id_ID.srt	5.1 KB
3. Queue with stack problem solution - recursion-ro_RO.srt	5.0 KB
3. Queue with stack problem solution - recursion-pl_PL.srt	4.9 KB
3. Queue with stack problem solution - recursion-en_US.srt	4.8 KB
1. Max in a stack problem solution.mp4	32.0 MB
3. Queue with stack problem solution - recursion.mp4	25.9 MB
2. Queue with stack problem solution.mp4	24.7 MB
/.../6. Data Structures - Linked Lists/
2. Linked list introduction - operations-pl_PL.srt	16.1 KB
2. Linked list introduction - operations-en_US.srt	15.6 KB
7. Practical (real-world) applications of linked lists-th_TH.srt	12.5 KB
5. Linked list implementation III-pl_PL.srt	12.1 KB
5. Linked list implementation III-en_US.srt	11.8 KB
3. Linked list implementation I-pl_PL.srt	10.8 KB
3. Linked list implementation I-en_US.srt	10.6 KB
6. Comparing linked lists and arrays-pl_PL.srt	9.1 KB
6. Comparing linked lists and arrays-en_US.srt	8.9 KB
7. Practical (real-world) applications of linked lists-ro_RO.srt	7.4 KB
7. Practical (real-world) applications of linked lists-pl_PL.srt	7.1 KB
7. Practical (real-world) applications of linked lists-id_ID.srt	7.1 KB
7. Practical (real-world) applications of linked lists-en_US.srt	6.7 KB
1. What are linked lists-pl_PL.srt	6.7 KB
1. What are linked lists-en_US.srt	6.5 KB
4. Linked list implementation II-pl_PL.srt	5.7 KB
4. Linked list implementation II-en_US.srt	5.6 KB
7. Practical (real-world) applications of linked lists.mp4	38.2 MB
2. Linked list introduction - operations.mp4	35.0 MB
5. Linked list implementation III.mp4	31.3 MB
3. Linked list implementation I.mp4	28.8 MB
1. What are linked lists.mp4	20.0 MB
4. Linked list implementation II.mp4	15.2 MB
6. Comparing linked lists and arrays.mp4	15.1 MB
/.../5. Interview Questions (Arrays)/
Anagram problem overview.html	0.4 KB
Duplicates in an array problem overview.html	0.6 KB
Integer reversion problem overview.html	0.3 KB
Palindrome problem overview.html	0.3 KB
Reversing an array in-place overview.html	0.4 KB
3. Integer reversion problem solution-pl_PL.srt	13.9 KB
3. Integer reversion problem solution-en_US.srt	13.7 KB
5. Duplicates in an array problem solution-pl_PL.srt	13.1 KB
5. Duplicates in an array problem solution-en_US.srt	12.9 KB
2. Palindrome problem solution-en_US.srt	8.0 KB
2. Palindrome problem solution-pl_PL.srt	8.0 KB
4. Anagram problem solution-en_US.srt	6.4 KB
4. Anagram problem solution-pl_PL.srt	6.3 KB
1. Reversing an array in-place solution-en_US.srt	6.2 KB
1. Reversing an array in-place solution-pl_PL.srt	6.1 KB
5. Duplicates in an array problem solution.mp4	33.1 MB
2. Palindrome problem solution.mp4	25.0 MB
3. Integer reversion problem solution.mp4	23.3 MB
4. Anagram problem solution.mp4	18.8 MB
1. Reversing an array in-place solution.mp4	10.7 MB
/.../15. Data Structures - Red-Black Trees/
1. What are red-black trees-pl_PL.srt	15.7 KB
1. What are red-black trees-en_US.srt	15.2 KB
7. Red-black tree implementation III-pl_PL.srt	14.5 KB
7. Red-black tree implementation III-en_US.srt	14.4 KB
3. Red-black trees - recoloring and rotation cases-pl_PL.srt	13.8 KB
3. Red-black trees - recoloring and rotation cases-en_US.srt	13.6 KB
4. Red-black tree illustrations-pl_PL.srt	11.2 KB
4. Red-black tree illustrations-en_US.srt	10.8 KB
5. Red-black tree implementation I-pl_PL.srt	9.1 KB
5. Red-black tree implementation I-en_US.srt	9.0 KB
7. Red-black tree implementation III.mp4	77.0 MB
2. The logic behind red-black trees-pl_PL.srt	8.4 KB
2. The logic behind red-black trees-en_US.srt	7.9 KB
6. Red-black tree implementation II-pl_PL.srt	7.9 KB
6. Red-black tree implementation II-en_US.srt	7.7 KB
8. Red-black tree implementation IV-pl_PL.srt	3.2 KB
9. Differences between red-black tree and AVL trees-pl_PL.srt	4.1 KB
9. Differences between red-black tree and AVL trees-en_US.srt	3.8 KB
8. Red-black tree implementation IV-en_US.srt	3.1 KB
1. What are red-black trees.mp4	31.1 MB
3. Red-black trees - recoloring and rotation cases.mp4	22.1 MB
2. The logic behind red-black trees.mp4	21.4 MB
5. Red-black tree implementation I.mp4	19.4 MB
8. Red-black tree implementation IV.mp4	17.0 MB
6. Red-black tree implementation II.mp4	16.6 MB
4. Red-black tree illustrations.mp4	13.4 MB
9. Differences between red-black tree and AVL trees.mp4	8.2 MB
/.../8. Interview Questions (Linked Lists)/
2. Reverse a linked list in-place solution-th_TH.srt	15.5 KB
Reverse a linked list in-place overview.html	0.1 KB
2. Reverse a linked list in-place solution-id_ID.srt	9.0 KB
2. Reverse a linked list in-place solution-ro_RO.srt	9.0 KB
2. Reverse a linked list in-place solution-en_US.srt	9.0 KB
2. Reverse a linked list in-place solution-pl_PL.srt	8.8 KB
1. Finding the middle node in a linked list solution-pl_PL.srt	7.8 KB
1. Finding the middle node in a linked list solution-en_US.srt	7.6 KB
Finding the middle node in a linked list overview.html	0.2 KB
2. Reverse a linked list in-place solution.mp4	29.5 MB
1. Finding the middle node in a linked list solution.mp4	19.8 MB
/.../16. Data Structures - Heaps/
2. Heap introduction - basics-pl_PL.srt	15.0 KB
2. Heap introduction - basics-en_US.srt	14.3 KB
9. Heap implementation II-pl_PL.srt	14.0 KB
3. Heap introduction - array representation-pl_PL.srt	13.7 KB
9. Heap implementation II-en_US.srt	13.7 KB
3. Heap introduction - array representation-en_US.srt	13.5 KB
6. Heap introduction - operations complexities-th_TH.srt	12.2 KB
4. Heap introduction - remove operation-pl_PL.srt	10.4 KB
6. Heap introduction - operations complexities-en_US.srt	6.8 KB
9. Heap implementation II.mp4	79.6 MB
4. Heap introduction - remove operation-en_US.srt	10.1 KB
5. Using heap data structure to sort (heapsort)-pl_PL.srt	9.1 KB
5. Using heap data structure to sort (heapsort)-en_US.srt	8.6 KB
6. Heap introduction - operations complexities-ro_RO.srt	7.1 KB
6. Heap introduction - operations complexities-pl_PL.srt	6.9 KB
6. Heap introduction - operations complexities-id_ID.srt	6.9 KB
8. Heap implementation I-pl_PL.srt	6.7 KB
8. Heap implementation I-en_US.srt	6.7 KB
1. What are priority queues-pl_PL.srt	6.7 KB
1. What are priority queues-en_US.srt	6.2 KB
7. Binomial and Fibonacci heaps-pl_PL.srt	5.9 KB
7. Binomial and Fibonacci heaps-en_US.srt	5.7 KB
10. Heap implementation III-en_US.srt	5.6 KB
10. Heap implementation III-pl_PL.srt	5.6 KB
11. Heaps in Python-pl_PL.srt	4.9 KB
11. Heaps in Python-en_US.srt	4.8 KB
6. Heap introduction - operations complexities.mp4	41.8 MB
10. Heap implementation III.mp4	40.2 MB
2. Heap introduction - basics.mp4	30.6 MB
3. Heap introduction - array representation.mp4	19.8 MB
8. Heap implementation I.mp4	19.1 MB
7. Binomial and Fibonacci heaps.mp4	18.9 MB
4. Heap introduction - remove operation.mp4	18.8 MB
1. What are priority queues.mp4	13.4 MB
5. Using heap data structure to sort (heapsort).mp4	12.9 MB
11. Heaps in Python.mp4	12.5 MB
/.../20. Graph Algorithms - Graph Traversal Algorithms/
5. Depth-first search introduction-pl_PL.srt	14.6 KB
5. Depth-first search introduction-en_US.srt	14.3 KB
1. Breadth-first search introduction-pl_PL.srt	12.7 KB
1. Breadth-first search introduction-en_US.srt	12.4 KB
4. WebCrawler basic implementation-en_US.srt	12.3 KB
4. WebCrawler basic implementation-pl_PL.srt	12.2 KB
7. Memory management BFS vs DFS-th_TH.srt	11.8 KB
2. Breadth-first search implementation-pl_PL.srt	10.5 KB
2. Breadth-first search implementation-en_US.srt	10.4 KB
6. Depth-first search implementation-pl_PL.srt	7.7 KB
3. What are WebCrawlers (core of search engines)-pl_PL.srt	7.4 KB
6. Depth-first search implementation-en_US.srt	7.4 KB
3. What are WebCrawlers (core of search engines)-en_US.srt	7.4 KB
7. Memory management BFS vs DFS-ro_RO.srt	6.7 KB
7. Memory management BFS vs DFS-id_ID.srt	6.6 KB
7. Memory management BFS vs DFS-pl_PL.srt	6.6 KB
7. Memory management BFS vs DFS-en_US.srt	6.3 KB
Depth-first search implementation II.html	1.2 KB
4. WebCrawler basic implementation.mp4	45.3 MB
1. Breadth-first search introduction.mp4	39.6 MB
3. What are WebCrawlers (core of search engines).mp4	32.9 MB
5. Depth-first search introduction.mp4	32.8 MB
7. Memory management BFS vs DFS.mp4	31.2 MB
2. Breadth-first search implementation.mp4	26.9 MB
6. Depth-first search implementation.mp4	23.8 MB
/.../4. Data Structures - Arrays/
3. Arrays in Python-pl_PL.srt	11.1 KB
3. Arrays in Python-en_US.srt	10.8 KB
2. Arrays introduction - operations-pl_PL.srt	9.7 KB
2. Arrays introduction - operations-en_US.srt	9.4 KB
1. What are array data structures-pl_PL.srt	9.3 KB
1. What are array data structures-en_US.srt	8.9 KB
4. What are real arrays in Python-pl_PL.srt	5.3 KB
4. What are real arrays in Python-en_US.srt	5.1 KB
3. Arrays in Python.mp4	27.2 MB
1. What are array data structures.mp4	26.2 MB
2. Arrays introduction - operations.mp4	26.2 MB
4. What are real arrays in Python.mp4	17.7 MB
/.../9. Data Structures - Stacks/
4. Stack implementation-en_US.srt	10.8 KB
4. Stack implementation-pl_PL.srt	10.5 KB
3. Stack memory visualization-en_US.srt	8.2 KB
3. Stack memory visualization-pl_PL.srt	8.0 KB
5. Practical (real-world) applications of stacks-th_TH.srt	7.9 KB
1. What are stacks-pl_PL.srt	6.5 KB
1. What are stacks-en_US.srt	6.3 KB
2. Stacks in memory management (stacks and heaps )-pl_PL.srt	5.2 KB
2. Stacks in memory management (stacks and heaps )-en_US.srt	5.1 KB
5. Practical (real-world) applications of stacks-ro_RO.srt	4.4 KB
5. Practical (real-world) applications of stacks-id_ID.srt	4.3 KB
5. Practical (real-world) applications of stacks-pl_PL.srt	4.2 KB
5. Practical (real-world) applications of stacks-en_US.srt	4.2 KB
4. Stack implementation.mp4	26.6 MB
3. Stack memory visualization.mp4	17.3 MB
5. Practical (real-world) applications of stacks.mp4	16.9 MB
1. What are stacks.mp4	11.1 MB
2. Stacks in memory management (stacks and heaps ).mp4	9.3 MB
/.../10. Data Structures - Queues/
2. Queue implementation-en_US.srt	10.6 KB
2. Queue implementation-pl_PL.srt	10.6 KB
1. What are queues-pl_PL.srt	5.7 KB
1. What are queues-en_US.srt	5.5 KB
2. Queue implementation.mp4	26.6 MB
1. What are queues.mp4	11.1 MB
/.../7. Data Structures - Doubly Linked Lists/
2. Doubly linked list implementation-pl_PL.srt	10.3 KB
2. Doubly linked list implementation-en_US.srt	10.2 KB
1. What are doubly linked lists-pl_PL.srt	10.1 KB
1. What are doubly linked lists-en_US.srt	9.6 KB
3. Running time comparison linked lists and arrays-pl_PL.srt	5.0 KB
3. Running time comparison linked lists and arrays-en_US.srt	5.0 KB
2. Doubly linked list implementation.mp4	41.4 MB
1. What are doubly linked lists.mp4	30.9 MB
3. Running time comparison linked lists and arrays.mp4	15.8 MB
/.../13. Interview Questions (Binary Search Trees)/
1. Compare binary trees solution-th_TH.srt	10.1 KB
Compare binary trees overview.html	0.2 KB
1. Compare binary trees solution-ro_RO.srt	5.8 KB
1. Compare binary trees solution-id_ID.srt	5.7 KB
1. Compare binary trees solution-pl_PL.srt	5.7 KB
1. Compare binary trees solution-en_US.srt	5.6 KB
1. Compare binary trees solution.mp4	37.3 MB
/.../17. Interview Questions (Heaps)/
Interview question #1 - checking heap properties.html	0.5 KB
2. Interview question #2 - solution-en_US.srt	9.6 KB
2. Interview question #2 - solution-pl_PL.srt	9.5 KB
1. Interview question #1 - solution-pl_PL.srt	9.0 KB
1. Interview question #1 - solution-en_US.srt	8.6 KB
Interview question #2 - max heap to a min heap.html	0.1 KB
2. Interview question #2 - solution.mp4	29.1 MB
1. Interview question #1 - solution.mp4	21.2 MB
/
TutsNode.com.txt	0.1 KB
[TGx]Downloaded from torrentgalaxy.to .txt	0.6 KB
/.../24. Interview Questions (Shortest Paths)/
1. How to use Bellman-Ford algorithm on the FOREX-en_US.srt	8.8 KB
1. How to use Bellman-Ford algorithm on the FOREX-pl_PL.srt	8.6 KB
2. Interview question #1 - solution-en_US.srt	5.5 KB
2. Interview question #1 - solution-pl_PL.srt	5.3 KB
Interview question #1 - detecting negative cycles on the FOREX.html	0.4 KB
2. Interview question #1 - solution.mp4	21.9 MB
1. How to use Bellman-Ford algorithm on the FOREX.mp4	17.3 MB
/.../19. Graph Algorithms Overview/
2. Adjacency matrix and adjacency list-pl_PL.srt	7.7 KB
2. Adjacency matrix and adjacency list-en_US.srt	7.6 KB
3. Applications of graphs-pl_PL.srt	6.1 KB
3. Applications of graphs-en_US.srt	5.7 KB
1. Graph theory overview-pl_PL.srt	5.2 KB
1. Graph theory overview-en_US.srt	5.0 KB
2. Adjacency matrix and adjacency list.mp4	19.9 MB
3. Applications of graphs.mp4	13.6 MB
1. Graph theory overview.mp4	13.4 MB
/.../2. Data Structures Overview/
1. Why to use data structures-pl_PL.srt	7.1 KB
1. Why to use data structures-en_US.srt	6.7 KB
2. Data structures and abstract data types-en_US.srt	4.9 KB
2. Data structures and abstract data types-pl_PL.srt	4.9 KB
1. Why to use data structures.mp4	23.4 MB
2. Data structures and abstract data types.mp4	14.9 MB
/.../28. Interview Questions (Sorting)/
Interview question #1 - solution.html	2.1 KB
Interview question #3 - solution.html	1.8 KB
Interview question #2 - solution.html	1.6 KB
Interview question #2 - implement quicksort with iteration.html	0.6 KB
Interview question #1 - implementing TimSort algorithm.html	0.5 KB
Interview question #3 - implementing selection sort with recursion.html	0.3 KB
/.../29. Next Steps/
Next steps.html	1.8 KB
Total files 693