Codechef

Competitive Programming

Develop your coding skills, learn a new language or prepare for campus placements and job interviews, you can do it all with these awesome courses.

Personal and Skill Development

In this course, Sanket Singh will discuss important concepts of String Algorithms and Computational Geometry in a comprehensive manner, starting from a basic introduction, proof techniques and solving competitive programming problems. Learners aspiring to perform in competitive programming will benefit from this course. The course will be taught in Hindi and the notes will be provided in English.

Course on String Algorithms and Computational Geometry

In this course, Pulkit will cover important concepts of Mixed Problem Solving and this course would be helpful for aspirants preparing for Competitive Programming Exams. Learners at any stage of their preparation will be benefited by the course. The course will be covered in Hindi and the notes will be provided in English.

Course on Mixed Problem Solving (Intermediate - Advanced)

In this course, Riya Bansal will discuss important concepts under Graph Algorithms. This course will be helpful for aspirants preparing for Competitive Programming exams. This course will be covered in English and the notes will be provided in English.


Course on Graph Algorithms

In this course, Pulkit will cover important concepts under Advanced Dynamic Programming. This course would be helpful for aspirants preparing for Competitive Programming Exams. The course will be covered in Hindi and the notes will be provided in English. 

Course on Advanced Dynamic Programming

In this course, Riya is going to talk about various String Algorithms, such as Rabin Karp, KMP, Z-Algo, and other popularly used string algorithms for interview preparation. The course will be delivered in English and notes for the same will be provided in English as well.

Course on String Algorithms

In this course, Sanket Singh will be covering important concepts related to Graphs & Trees right from the basics. Students will learn concepts related to unweighted as well as weighted, and undirected as well as directed graphs. Learners interested in Competitive Programming can gain maximum benefit from this course. The course will be delivered in Hindi and the notes will be provided in English.

In this course, Pulkit Chhabra will cover various string algorithms such as Rabin Karp, KMP, Z-Algorithm, etc. All the important topics will be discussed in detail. Learners at any stage of their preparations will benefit from the course. The course will be covered in Hindi and notes will be provided in Hindi & English.

In this course, Sanket Singh will be covering important concepts related to Advanced Dynamic Programming. This course would be helpful for aspirants preparing for Competitive Programming Exams. The course will be covered in Hindi and the notes will be provided in English.

In this course, Pulkit Chhabra will be covering important concepts related to Graphs & Trees right from the basics. Students will learn concepts related to unweighted as well as weighted, and undirected as well as directed graphs. Learners interested in Competitive Programming can gain maximum benefit from this course. The lessons will be delivered in Hindi.

SELF STUDY

Competitive Programming Advanced

New courses coming soon

Graph Algorithms

Advanced Dynamic Programming

String Algorithms

Segment Trees

Segment Trees & BIT

Advanced Number Theory

Computational Geometry

Game Theory

Advanced Combinatorics

Graph Algorithms

Course on Graph Algorithms

Riya Bansal

Course on Graph Algorithms

Pulkit Chhabra

Course on Graph Algorithms

Sanket Singh

Advanced Dynamic Programming

Course on Advanced Dynamic Programming

Pulkit Chhabra

Course on Advanced Dynamic Programming

Sanket Singh

Course on Mixed Problem Solving (Intermediate - Advanced)

Pulkit Chhabra

String Algorithms

Course on String Algorithms

Riya Bansal

Course on String Algorithms

Pulkit Chhabra

Course on String Algorithms and Computational Geometry

Sanket Singh