CS Research Undergrad at IIIT Hyderabad, IOI 2018, ICPC Regionals 2019, 2020.

Competitive Programming

Istasis Mishra

Plus Group for course 516I7U4S

English

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

Expert

Advanced

Intermediate

Basic Data Structures

Expert Data Structures

Square Root Decomposition

String Algorithms

Course on Square Root Decomposition, Tries & Sparse Tables

PREVIEW

Course on Square Root Decomposition, Tries & Sparse Tables

Istasis Mishra

Ended on Dec 7

15 lessons

0 practices