0 enrolled

A&DS English Course

Name: A&DS English Course
Author: Pavel Mavrin

Pavel Mavrinadded by @fottyseven

Medium · Normal

A&DS English

Rating

★★★★★0

0 reviews

Length

93h 49m

61 videos

Your XP

+56,290

on completion

Progress

0/61 done

01
A&DS S01E01. Algorithms. Time complexity. Merge sort.
101m · +1010 XP
02
A&DS S01E02. Data structures. Binary Heap. Heap sort
85m · +850 XP
03
A&DS S01E03. Quick sort. Order statistics
73m · +730 XP
04
A&DS S01E04. Lower bounds for sorting. Radix sort. Sorting networks
105m · +1050 XP
05
A&DS S01E05. Binary Search
84m · +840 XP
06
A&DS S01E06. Stacks. Queues. Amortized cost
96m · +960 XP
07
A&DS S01E07. Linked Lists. Pointer Machine
87m · +870 XP
08
A&DS S01E08. Disjoint Sets
108m · +1080 XP
09
A&DS S01E09. Fibonacci Heap
101m · +1010 XP
10
A&DS S01E10. Dynamic programming
92m · +920 XP
11
A&DS S01E11. Dynamic programming. Part 2
86m · +860 XP
12
A&DS S01E12. Knapsack Problem
103m · +1030 XP
13
A&DS S01E13. DP on subsets, DP on profiles
92m · +920 XP
14
A&DS S01E14. Hash tables
95m · +950 XP
15
A&DS S01E15. Perfect hashing, cuckoo hashing, Bloom filter
92m · +920 XP
16
A&DS. Time Complexity of Union-Find (inverse Ackermann function)
130m · +1300 XP
17
A&DS. Eval-Link-Update
101m · +1010 XP
18
A&DS S02E01. Segment Tree
87m · +870 XP
19
A&DS S02E02. Segment Trees, Lazy Propagation
95m · +950 XP
20
A&DS S02E03. Fenwick Tree, Sparse Table
89m · +890 XP
21
A&DS S02E04. 2D Segment Tree Problems
100m · +1000 XP
22
A&DS S02E05. Binary Search Tree, AVL tree
88m · +880 XP
23
A&DS S02E06. Treaps, implicit keys
78m · +780 XP
24
A&DS S02E07. Splay Tree
78m · +780 XP
25
A&DS S02E08. Scapegoat Tree, List Order Maintenance
100m · +1000 XP
26
A&DS S02E09. Binary Lifting. LCA. Farach-Colton and Bender Algorithm
93m · +930 XP
27
A&DS S02E09. Heavy-Light Decomposition
66m · +660 XP
28
A&DS S02E11. Link-Cut Tree
81m · +810 XP
29
A&DS S02E12. Euler Tour Tree, Tarjan's Algorithm
69m · +690 XP
30
A&DS S02E13. Centroid Decomposition
87m · +870 XP
31
A&DS S02E14. External Memory Algorithms
84m · +840 XP
32
A&DS S02E15. Complexity Classes
92m · +920 XP
33
A&DS S03E01. Graphs. Depth First Search. Topological sorting
86m · +860 XP
34
A&DS S03E02. Strongly Connected Components, 2-SAT
93m · +930 XP
35
A&DS S03E03. Bridges, Articulation Points, Euler Cycle
112m · +1120 XP
36
A&DS S03E04. Dominator Tree
102m · +1020 XP
37
A&DS S03E05. Minimum Spanning Tree
97m · +970 XP
38
A&DS S03E06. Breadth-First Search, Dijkstra's Algorithm
109m · +1090 XP
39
A&DS S03E07. Bellman-Ford and Floyd-Warshall Algorithms
96m · +960 XP
40
A&DS S03E08. Graph Games
94m · +940 XP
41
A&DS S03E09. Strings. Hashing. KMP. Z Algorithm
93m · +930 XP
42
A&DS S03E10. Finite State Automata
118m · +1180 XP
43
A&DS S03E11. Aho Corasick Algorithm
90m · +900 XP
44
A&DS S03E12. Suffix Array
95m · +950 XP
45
A&DS S03E13. Suffix Tree. Ukkonen's Algorithm
85m · +850 XP
46
A&DS S03E14. Y-Fast Trie
103m · +1030 XP
47
A&DS S03E15. Fusion Tree
84m · +840 XP
48
A&DS S04E01. Maximum Matchings in Bipartite Graphs
87m · +870 XP
49
A&DS S04E02. Maximum Matchings in Non-Bipartite Graphs
76m · +760 XP
50
A&DS S04E03. Flows, cuts. Ford-Fulkerson algorithm
99m · +990 XP
51
A&DS S04E04. Flows. Dinic's algorithm
90m · +900 XP
52
A&DS S04E05. Hopcroft-Karp algorithm, Push-Relabel
99m · +990 XP
53
A&DS S04E06. Assignment Problem. Hungarian Algorithm
86m · +860 XP
54
A&DS S04E07. Minimum Cost Flows
88m · +880 XP
55
A&DS S04E08. Global Minimum Cuts
92m · +920 XP
56
A&DS S04E09. Linear Programming
98m · +980 XP
57
A&DS S04E10. Number Theory Algorithms
108m · +1080 XP
58
A&DS S04E11. Basic Cryptography Algorithms
81m · +810 XP
59
A&DS S04E12. Fast Fourier Transform
74m · +740 XP
60
A&DS S04E13. Approximation Algorithms
82m · +820 XP
61
A&DS S04E14. Parallel Algorithms
94m · +940 XP