Level 1 Training (2023)

This program builds on your foundation with core algorithms, data structures, and number theory. By the end, you'll be ready to confidently solve Div2 A, B, and C problems.

Go to Session Archive Go to Practice Sheets View Records

Basics of Graph

Session 1: Introduction to Graph

Title	Link
Session Record	View
Practice Sheet	Go to Sheet

Session 2: Graph Practice

Title	Link
Session Record	View
Practice Sheet	Go to Sheet

Session 3: DFS and Applications

Title	Link
Presentation	View
Session Record	View
Practice Sheet	Go to Sheet

Session 4: Graph Practice

Title	Link
Session Record	View
Practice Sheet	Go to Sheet

Session 5: Graph Practice (Problems)

Title	Link
Session Record	View
Practice Sheet	Go to Sheet
Problem 1 + Solution	Problem / Solution
Problem 2 + Solution	Problem / Solution
Problem 3 + Solution	Problem / Solution
Problem 4 + Solution	Problem / Solution

Session 6: BFS Algorithm

Title	Link
Session Record	View
Practice Sheet	Go to Sheet

Session 7: Tree Practice

Title	Link
Session Record	View
Practice Sheet	Go to Sheet
Problem 1 + Solution	Problem / Solution
Problem 2 + Solution	Problem / Solution

Session 8: BFS Practice

Title	Link
Session Record	View
Practice Sheet	Go to Sheet
Problem K + Solution	Solution
Problem L + Solution	Solution
Problem P + Solution	Solution
Problem N + Solution	Solution

Dynamic Programming

Prerequisites

Resource	Link
Recursion in Arabic	View
Measuring Algorithms Performance #1 (Arabic)	View
Measuring Algorithms Performance #2 (Arabic)	View
Recursion in English	View
Practice Sheet: Basic Recursion	Go to Sheet
Practice Sheet: Recursion & Backtracking	Go to Sheet

DP Basics (Knapsack, LIS, LCS)

Resource	Link
Intro to DP #1 (Arabic)	View
Intro to DP #2 (Arabic)	View
Knapsack, LIS, LCS (Arabic)	View
Fibonacci (Iteration vs Recursion)	View
Blog: Introduction to DP	Read
Blog: Knapsack Problem	Read
Practice Sheet	Go to Sheet