Legend

Master

Expert

Star

Rising Star

Germany

International Institute Of Information Technology (IIIT) - Hyderabad

Software Engineer @ Google Munich

High Frequency Trader @ Alphagrep Securities

Intern @ Google Zurich

Intern @ Facebook London

Intern @ Chennai Mathematical Institute

Google Quantum AI

ACM ICPC World Finalist - 2017, 2018


Trainer for Indian IOI Team - 2016 - 2018


Quantum Computing Enthusiast - Contributer to Google's Open Source Quantum Libraries Cirq and OpenFermion. 

In all 9 dsitricts, Delhi, India

Sensational! We are proud to call you an Unacademy veteran. Onwards and upwards!

10k minutes

Your perseverance is inspirational. Cherish this huge moment, you’ve earned it!

5k minutes

Woohoo! You’re officially a learning rockstar. Keep racking up more thousands!

1000 minutes

You deserve this honour for all the hard work! 500 is a big milestone. Keep going higher and faster!

500 minutes

Congratulations on your first learning milestone! Here's to many more in the future. 

10 minutes

Tanuj Khattar

In this class, Tanuj will discuss some expert level applications of Centroid Decomposition. The students are expected to know the basics of Centroid Decomposition and should have preferably watched previous classes of the series to be able to follow the content easily. 
We will be solving problems that only a handful of people in the world have solved, and hence the session should be valuable for a majority of interested students.

Competitive Programming

Applications of Centroid Decomposition - Expert

Queries on Trees

In this class, Tanuj will discuss some advance applications for Centroid Decomposition. The students are expected to know the basics of Centroid Decomposition and should have preferably watched previous classes of the series to be able to follow the content easily. 
The session should be valuable for all non-experts of the field.

Applications of Centroid Decomposition - Advanced

In this class, Tanuj will discuss some beginner and intermediate level applications for Centroid Decomposition. We will solve interesting problems and revise the core concepts to develop familiarity with the topic.

Applications of Centroid Decomposition - Beginner

In this class, Tanuj will teach the foundations of Centroid Decomposition, which is an extremely powerful technique for solving a wide variety of problems related to answering queries on trees.

Introduction to Centroid Decomposition

In this class, I wil talk about my upcoming course on Queries on Trees and will discuss the necessary pre-requisites for this course like an overview of techniques to answer Queries on Arrays.

Launching Queries on Trees Course

In this session, we will learn techniques about how to answer point update and range queries over sparse ranges. Specifically, we will discuss Coordiation Compression and Spars Segment Trees.

Sparse Segment Trees

Advanced

Segment Trees

Free Classes

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.

Course on Data Structures (Square Root Decomposition)

Problem Discussion - II (Theoretical)

Intermediate

Square Root Decomposition

In this course, Tanuj Khattar will discuss various advance techniques, like HLD, ETT, Centroid Decomposition, Auxiliary Trees. The sessions will be conducted in Hindi and notes will be provided in English.

Tanuj Khattar

Ex-educator

691K

Free Classes

Applications of Centroid Decomposition - Expert

Tanuj Khattar

Applications of Centroid Decomposition - Advanced

Tanuj Khattar

Applications of Centroid Decomposition - Beginner

Tanuj Khattar

Introduction to Centroid Decomposition

Tanuj Khattar

Launching Queries on Trees Course

Tanuj Khattar

Sparse Segment Trees

Tanuj Khattar

Competitive Programming

Course on Data Structures (Square Root Decomposition)

Tanuj Khattar

Course on Queries on Trees

Tanuj Khattar