Foundation Curriculum
 Share
The version of the browser you are using is no longer supported. Please upgrade to a supported browser.Dismiss

View only
 
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1
17 June18 June19 June20 June21 June22 June23 June24 June25 June
2
IntroAlgorithms 1BasicGraph 2UpsolvingDP 1 (Basics)ContestContest
3
Command LineLinear SearchUpsolving DayGraphs:

- Basic Terms (Directed, Undirected, Weighted, Unweighted, Loops, Parallel Edges, Simple Graph, Multigraphs, Bipartite, Planar, Topological Sort)
- Adjacency List
- Adjacency Matrix
- Edge List
- Bipartite Graphs
- DAG
- Grid
"Trees:

- Basic Terms (Rooted, Unrooted, Spanning Trees)
"
heapUpsolving DayGreedy:

- Coin problem
- Scheduling
- Tasks and deadlines
- Minimizing sums
ContestFinal Contest
4
ArraysBinary SearchBinary search TreedijkstraDynamic Programming:

- Coin Problem
- Knapsack
- Memoization Term
- LIS O(N^2)
5
FunctionsSorting (Insertion, Merge, Quick, Counting, Radix)in-post-pre order traversalprim
6
StringsQuick Selectdfsunion find
7
Standart Libraries (C++, Python)Fast Exponentiationbfskruskal
8
Recursion (In Mathematics And Programming)Stack-Queue-linked list
9
Enumeration
10
Brute-force
11
Pointers and References
12
Structs and Classes
13
Complexities (Time + Memory)dfs-bfs lab sessiongraph lab session
greedy and dp lab session
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
Loading...
Main menu