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, Raja Vikramaditya Panda will cover all the techniques related to Stack and Queue that are used in CP, all the Greedy as well as String Algorithms. Learners at any stage of their preparation will be benefited from the class. The class will be conducted in English & notes will be provided in English.

Course on Stack, Queue, Greedy and String Algorithms

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 as well as about Game Theory& Greedy Algorithms. The course will be delivered in English and notes for the same will be provided in English as well.

Course on String Algorithms, Game Theory & Greedy Algorithms

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, Suresh Upadhyay will provide in-depth knowledge of String Algorithms & Computational Geometry. The course will be helpful for aspirants preparing for Competitive Programming. Learners at any stage of their preparation will be benefited from the course.  Class dates and timings along with topic details are given below. The course will be covered in Hinglish and the notes will be provided in English.

Course on String Algorithms & Computational Geometry

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 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, 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, Riya will discuss various String Algorithms such as Rabin Karp, KMP, Z-Algorithm, etc. Also, the educator will be discussing a lot of problems based on the above algorithms as well. The course will be conducted in English and notes will also be provided in English. 

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, Pulkit Chhabra will cover various string algorithms and CG concepts. All the important topics will be discussed in detail. The course will be helpful for aspirants preparing for Competitive Programming. 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.

Course on Computational Geometry and String Algorithms

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.

SELF STUDY

Competitive Programming String Algorithms

Complete syllabus with Structured Courses

Courses for you

Course on String Algorithms and Computational Geometry

Sanket Singh

Course on String Algorithms

Pulkit Chhabra

Course on Stack, Queue, Greedy and String Algorithms

Raja Vikramaditya Panda

More Courses

Course on String Algorithms

Riya Bansal

Course on String Algorithms, Game Theory & Greedy Algorithms

Riya Bansal

Course on Square Root Decomposition & Tries and Sparse Tables

Istasis Mishra

Course on String Algorithms

Riya Bansal

Course on Square Root Decomposition

Suresh Upadhyay

Course on Computational Geometry and String Algorithms

Pulkit Chhabra

Course on String Algorithms & Computational Geometry

Suresh Upadhyay

Course on Square Root Decomposition, Tries & Sparse Table

Suresh Upadhyay

Course on Square Root Decomposition, Tries & Sparse Tables

Istasis Mishra