Introduction

Vekt: 1.0

Hello World

Vekt: 1.0

Ad-hoc - Problem: Tournament adversaries

Vekt: 1.0

Graphs - Representation

Vekt: 1.0

Graphs - Finding a path

Vekt: 1.0

Graphs - Solving a maze

Vekt: 1.0

Graphs - Breadth-first search

Vekt: 1.0

Graphs - Connected components

Vekt: 1.0

Graphs - Problem: Fire!

Vekt: 1.0

Graphs - Problem: Cross Bracing

Vekt: 1.0

Graphs - Bipartite

Vekt: 1.0

Graphs - Topological sort

Vekt: 1.0

Graphs - Depth-first search: cycle finding

Vekt: 1.0

Graphs - DFS: topological order

Vekt: 1.0

Graphs - Strongly connected components

Vekt: 1.0

Graphs - Problem: Dominos

Vekt: 1.0

Graphs - Dijkstra

Vekt: 1.0

Graphs - Maximum flow (Edmonds-Karp)

Vekt: 1.0

Graphs - Maximum flow runtime

Vekt: 1.0

DP - Introduction

Vekt: 1.0

DP - Knapsack

Vekt: 1.0

DP - Top down VS Bottom up

Vekt: 1.0

DP - State graph

Vekt: 1.0

DP - Shortest paths: Acyclic formulation

Vekt: 1.0

DP - Knapsack, build the solution

Vekt: 1.0

DP - Memory reduction

Vekt: 1.0

DP - Knapsack flipping the state formulation

Vekt: 1.0

DP - Candy problem, parameter decution

Vekt: 1.0

DP - Problem: Copying books

Vekt: 1.0

DP - Problem: Knockout Tournament

Vekt: 1.0

DP - Problem: Forming Quiz Teams

Vekt: 1.0

Binary search - Introduction

Vekt: 1.0

Binary search - Square root

Vekt: 1.0

Binary search - Search on the answer

Vekt: 1.0

Binary Search - Problem: Glyph Recognition

Vekt: 1.0

Techniques - Brute force on solution structure

Vekt: 1.0

Techniques - Problem: Iron and Coal

Vekt: 1.0

Geometry - Cross product

Vekt: 1.0

Geometry - Point orientation

Vekt: 1.0

Geometry - Point in convex polygon

Vekt: 1.0