Introduction

Weight : 1.0

Hello World

Weight : 1.0

Ad-hoc - Problem: Tournament adversaries

Weight : 1.0

Graphs - Representation

Weight : 1.0

Graphs - Finding a path

Weight : 1.0

Graphs - Solving a maze

Weight : 1.0

Graphs - Breadth-first search

Weight : 1.0

Graphs - Connected components

Weight : 1.0

Graphs - Problem: Fire!

Weight : 1.0

Graphs - Problem: Cross Bracing

Weight : 1.0

Graphs - Bipartite

Weight : 1.0

Graphs - Topological sort

Weight : 1.0

Graphs - Depth-first search: cycle finding

Weight : 1.0

Graphs - DFS: topological order

Weight : 1.0

Graphs - Strongly connected components

Weight : 1.0

Graphs - Problem: Dominos

Weight : 1.0

Graphs - Dijkstra

Weight : 1.0

Graphs - Maximum flow (Edmonds-Karp)

Weight : 1.0

Graphs - Maximum flow runtime

Weight : 1.0

DP - Introduction

Weight : 1.0

DP - Knapsack

Weight : 1.0

DP - Top down VS Bottom up

Weight : 1.0

DP - State graph

Weight : 1.0

DP - Shortest paths: Acyclic formulation

Weight : 1.0

DP - Knapsack, build the solution

Weight : 1.0

DP - Memory reduction

Weight : 1.0

DP - Knapsack flipping the state formulation

Weight : 1.0

DP - Candy problem, parameter decution

Weight : 1.0

DP - Problem: Copying books

Weight : 1.0

DP - Problem: Knockout Tournament

Weight : 1.0

DP - Problem: Forming Quiz Teams

Weight : 1.0

Binary search - Introduction

Weight : 1.0

Binary search - Square root

Weight : 1.0

Binary search - Search on the answer

Weight : 1.0

Binary Search - Problem: Glyph Recognition

Weight : 1.0

Techniques - Brute force on solution structure

Weight : 1.0

Techniques - Problem: Iron and Coal

Weight : 1.0

Geometry - Cross product

Weight : 1.0

Geometry - Point orientation

Weight : 1.0

Geometry - Point in convex polygon

Weight : 1.0