ABCDEFGHIJKLMNOPQRSTUVWXYZ
1
 Day #1
19.06.2023		Day #2
20.06.2023		Day #3
21.06.2023		Day #4
22.06.2023		Day #5
23.06.2023		Day #6
24.06.2023		Day #7
25.06.2023
2
10:00-11:00LectureWELCOMING DAY!Recursion, Complexities, Brute-forceIntroduction to Graphs:
- Basic Terms (Directed, Undirected, Weighted, Unweighted, Loops, Parallel Edges, Simple Graph, Multigraphs)
- Adjacency List, Adjacency Matrix, Edge List, DAG.
- Trees: Basic Terms (Rooted, Unrooted, Spanning Trees)		UPSOLVING DAYSieve, GCD, LCM,Fast ExpGreedy as a term, Where to use DP?, Basic concepts of DP, Fibonacci with DPFINAL CONTEST
3
BreakBreakBreakBreakBreak
4
11:15-12:15LectureHash Map - Set - Queue - Stack - Priority QueueDepth First SearchInverse Mod, Prefix Sum - Suffix SumCoin Problem, Knapsack Problem
5
BreakBreakBreakBreakBreak
6
12:30-13:30LectureSorting (Insertion, Bubble, Merge, Quick)Breadth First Search Two Pointers - Sliding WindowLIS, LCS
7
BreakBreakBreakBreakBreak
8
14:30-15:30LectureLinear Search / Binary Search
Using Binary Search for the answer		Shortest Path (Dijkstra)Bitwise Opr - Generate Perm.Grid, Tiling, Problem solving
9
BreakBreakBreakBreakBreak
10
15:40-16:40Lab SessionLab SessionLab SessionLab SessionLab Session
11
BreakBreakBreakBreakBreak
12
17:00-19:00Lab SessionLab SessionLab SessionLab SessionLab Session
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