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, 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, 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, Umang Agrawal will discuss important concepts of Basic Data Structure in C++. The course will be helpful for aspirants preparing for Programming exams. 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 & English and the notes will be provided in English.

Course on Basic Data Structure in C++

In this course, will cover important concepts of Tries & Sparse Table 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 English and the notes will be provided in English.


Course on Tries & Sparse Table

In this course, Kushagra Nigam will cover some advanced data structures like Tries, Segment Tree, and Heaps. We'll cover the concept as well as do questions to grasp the concept. The course will be delivered in English and notes for the same will be provided in English as well.

SELF STUDY

Competitive Programming Expert Data Structures

Complete syllabus with Structured Courses

Courses for you

Course on Tries & Sparse Table

Sanket Singh

Course on Data Structures - II (C++)

Pulkit Chhabra

Course on Square Root Decomposition & Tries and Sparse Tables

Istasis Mishra

More Courses

Course on Basic Data Structure in C++

Umang Agrawal

Course on Advanced Data Structures

Kushagra Nigam

Course on Square Root Decomposition, Tries & Sparse Tables

Istasis Mishra