Goal

Competitive Programming

Show only

Plus

Special classes

Batches

Filter by

All courses

Ongoing

Upcoming

Completed

Language

English

Topic

All topics

Miscellaneous

Advanced

Intermediate

This will be an introductory session for basic game theory. We will assume that the learner is comfortable with basic DSA, and start with simple two player games and aim to cover Grundy Numbers by the end.

Introduction to Game Theory For Programming

Game Theory

We will be starting with the properties of Directed Acyclic Graphs (DAGs), learn about Topological Sort,  Strongly Connected Components and the compressed SCC DAG of a generic directed graph. Prior knowledge of basic graph algorithms will be assumed, including DFS.

Directed Acyclic Graphs (DAGs) and SCCs

Graph Algorithms

This will be the third session of a 3 part series, where we will be covering basics of Dynamic Programming, by looking at some classical problems. This is aimed at people who are new to DP.

Learn DP through Problem Solving 3

Dynamic Programming & Recursion

This will be the second session of a 3 part series, where we will be covering basics of Dynamic Programming, by looking at some classical problems. This is aimed at people who are new to DP.

Learn DP through Problem Solving 2

This will be the first session of a 3 part series, where we will be covering basics of Dynamic Programming, by looking at some classical problems. This is aimed at people who are new to DP.

Learn DP through Problem Solving 1

We will solve problems based on Dynamic Programming. A basic understanding of dynamic programming will be assumed. The class will be conducted in English.

DP Problem Solving Session

In this session, we will discuss the easiest three problems from the ICPCTR04 contest, which is a mirror of ACM-ICPC India Regionals, Online Preliminary Round 2016 (ACMIND16). See https://www.codechef.com/icpc/training-series for more details.

AIM-ICPC | Contest 4 | Lecture 2

ICPC and IOI

We will cover graph algorithms from scratch which spills help with your interview preparations. There will be little to no prerequisites needed for this.

Graph algorithms for interview preparations

We will discuss some classical puzzle and math based problems and brain teasers which might help you in your interview preparations. There will be little to no prerequisites needed for this.

Maths and Puzzles for Interview Preparation

Discrete Mathematics

In this session, we will discuss the easiest three problems from the ICPCTR03 contest, which is a mirror of ICPC 2017, Online Preliminary Round (ACMIND17). See https://www.codechef.com/icpc/training-series for more details.

AIM-ICPC | Contest 3 | Lecture 1

In this session, we will discuss the hardest two problems from ICPCTR02 contest, which is a mirror of ICPC Asia Regionals 2018 Online Preliminary Round (ACMIND18). See https://www.codechef.com/icpc/training-series for more details.

AIM-ICPC | Contest 2 | Lecture 2

Update: The session has been rescheduled to 2nd Jan due to a clash with a contest.
In this session, we will discuss the hardest problem from ICPCTR01 contest, which is a mirror of ICPC Asia Regionals 2019 Online Preliminary Round (ICPCIN19). See https://www.codechef.com/icpc/training-series for more details.

AIM-ICPC | Contest 1 | Lecture 2

Legend

Master

Expert

Star

Rising Star

India

CodeChef

Chennai Mathematical Institute (BSc)

Chennai Mathematical Institute (MSc)

Woohoo! You’re officially a learning rockstar. Keep racking up more thousands!

1000 minutes

You deserve this honour for all the hard work! 500 is a big milestone. Keep going higher and faster!

500 minutes

Your first century, you did it! Go ahead, tell the world. 

Arjun Arul

Expert

•

1K Followers

Introduction to Game Theory For Programming

Directed Acyclic Graphs (DAGs) and SCCs

Learn DP through Problem Solving 3

Learn DP through Problem Solving 2

Learn DP through Problem Solving 1

DP Problem Solving Session

AIM-ICPC | Contest 4 | Lecture 2

Graph algorithms for interview preparations

Maths and Puzzles for Interview Preparation

AIM-ICPC | Contest 3 | Lecture 1

AIM-ICPC | Contest 2 | Lecture 2

AIM-ICPC | Contest 1 | Lecture 2

Arjun Arul

Expert .css-1icgrfo-StyledTypography{font-weight:600;text-transform:initial;}.css-kc26im-StyledTypography{margin:0;color:var(--color-text-secondary);font-weight:600;text-transform:initial;}

•

1K Followers

Introduction to Game Theory For Programming

Directed Acyclic Graphs (DAGs) and SCCs

Learn DP through Problem Solving 3

Learn DP through Problem Solving 2

Learn DP through Problem Solving 1

DP Problem Solving Session

AIM-ICPC | Contest 4 | Lecture 2

Graph algorithms for interview preparations

Maths and Puzzles for Interview Preparation

AIM-ICPC | Contest 3 | Lecture 1

AIM-ICPC | Contest 2 | Lecture 2

AIM-ICPC | Contest 1 | Lecture 2

Expert