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, 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 and Hindi.

Course on Mixed Problem Solving (Intermediate)

In this course, Robin Khurana will discuss important topics under Competitive Programming through C++. The course will be helpful for the aspirants of the Programming Exams. The course will be conducted in English and the notes will be provided in English.

Course on Advanced Mathematics in Programming

In this course, Istasis Mishra will cover two widely used ways to solve query-based problems: Square Root Decomposition and Sparse Tables, and a String Data Structure called Tries. Learners preparing for Competitive Programming can gain benefit from this course. The lessons will be delivered in English and the notes as well will be provided in English. 

Course on Square Root Decomposition, Tries & Sparse Tables

In this course, we are going to cover the basics of different Data Structures such as Arrays, Stack, Queues, Linked Lists, Hash Maps, Heaps, Binary Trees, etc.

Course on Basic Data Structures

In this course, Pulkit Chhabra will be discussing the advanced Data Structures which will be helpful for aspirants preparing for Programming. Learners at an intermediate stage of their preparation will be benefited by the course. The course will be covered in Hindi.

Course on Data Structures - II (C++)

In this course Istasis Mishra will cover Square Root Decomposition & Tries and Sparse Tables. It will include square root decomposition, mo's algorithm, tries and sparse tables. Learners at any stage of their preparation would be benefited from the course. The course will be taught in English and notes will be provided in English.

Course on Square Root Decomposition & Tries and Sparse Tables

In this course, Suresh Upadhyay will cover all the techniques related to Square Root Decomposition, Tries and Sparse Tables that are used in CP. Learners at any stage of their preparation will be benefited from the class. The course will be conducted in Hinglish & notes will be provided in English.

Course on Square Root Decomposition, Tries & Sparse Table

In this course, Pulkit Chhabra will provide in-depth knowledge of Data Structures. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hindi and the notes will be provided in English./Hindi.

Course on Data Structures (C++) - II

In this course, Saptarshi Mukherjee will cover some advanced concepts of Mathematics comprising Combinatorics, Probability, Square Root Decomposition, and Matrix Exponentiation. The theory of the aforementioned topics shall be covered together with suitable problems of competitive programming. Essential prerequisites are only Elementary Mathematics and Probability. Prior knowledge of popular theorems and concepts on Probability and Combinatorics shall be a bonus.

In this course, Suresh Upadhyay will cover all the techniques related to Square Root Decomposition, Tries and Sparse Tables that are used in CP. Learners at any stage of their preparation will be benefited from the class. The course will be conducted in Hindi and English & notes will be provided in English.

Course on Square Root Decomposition

In this course, Utkarsh will discuss Square Root Decomposition. This course would be helpful for students interested in Competitive Programming. The sessions will be conducted in English and notes will also be provided in English.

In this course, Tanuj Khattar will discuss the important topics under Point Update Range Query problem in data structures and how it can be solved using Square Root Decomposition technique. The course would be helpful for aspirants preparing for Programming. Learners at any stage of their preparation will be benefited by the course. The course will be covered in bilingual language (Hindi and English) and the notes will be provided in English.

SELF STUDY

Competitive Programming Square Root Decomposition

Complete syllabus with Structured Courses

Courses for you

Course on Square Root Decomposition

Utkarsh Gupta

Course on Mixed Problem Solving (Intermediate)

Pulkit Chhabra

Course on Data Structures - II (C++)

Pulkit Chhabra

More Courses

Course on Basic Data Structures

Riya Bansal

Course on Data Structures (Square Root Decomposition)

Tanuj Khattar

Course on Square Root Decomposition & Tries and Sparse Tables

Istasis Mishra

Course on Advanced Mathematics in Programming

Saptarshi Mukherjee

Course on Data Structures (C++) - II

Pulkit Chhabra

Course on Square Root Decomposition

Suresh Upadhyay

Course on Square Root Decomposition, Tries & Sparse Table

Suresh Upadhyay

Course on Advanced Mathematics in Programming

Robin Khurana

Course on Square Root Decomposition, Tries & Sparse Tables

Istasis Mishra