Legend

Master

Expert

Star

Rising Star

India

North Twentyfour Parganas, West Bengal, India

Indian Institute of Technology Bhilai

KVPY SA Scholar with All India Rank 406

Awarded the Mamraj Agarwal Rashtriya Puraskar for securing AIR 5 in ISC-2017 with 98.5%

ICPC Regionalist in IIT Kharagpur zone in 2019. Secured 37th Rank at the regionals.

Master (2119) in Codeforces

Google

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

Woot! You're halfway to a century of learning minutes. Keep going strong!

50 minutes

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

10 minutes

Dedicate this special Teachers’ Day Hat to appreciate the efforts of your favorite educator

Happy Teachers' Day Hat 2021

Competitive Programming

Saptarshi Mukherjee

In this session, we'll discuss an important topic: Disjoint Set Union. Knowledge of this topic helps in solving a wide variety of problems efficiently. This shall therefore be quite crucial a session for intermediate-level programmers.

Concept of Disjoint Set Union

Advanced

Graph Algorithms

In this session, we'll solve the Graph-based problems from the popular website for practice: CSES. This shall be Part X of the lecture series and shall be highly beneficial for intermediate level programmers in graph theory.

CSES ProblemSet on Graphs Part X

In this session, we'll solve the Graph-based problems from the popular website for practice: CSES. This shall be Part IX of the lecture series and shall be highly beneficial for intermediate level programmers in graph theory.

CSES ProblemSet on Graphs Part IX

In this session, we'll discuss how to approach the problems A-D of Codeforces Round 735 so as to reach an easy and efficient solution. We'll emphasize how to decide the steps of approach by looking at the problem statement for the first time. This shall aid in making strategies for upcoming contests, including ICPC.

Codeforces Round 735 Discussion: Problems A - D

Miscellaneous

In this session, we'll solve the Graph-based problems from the popular website for practice: CSES. This shall be Part VIII of the lecture series and shall be beneficial for intermediate level programmers in graph theory.

CSES ProblemSet on Graphs Part VIII

In this session, we'll solve the Graph-based problems from the popular website for practice: CSES. This shall be Part VII of the lecture series and shall be beneficial for intermediate level programmers in graph theory.

CSES ProblemSet on Graphs Part VII

Free Classes

Software Development Engineer @ Arcesium | Former SDE and Instructor Intern @ Interviewbit | ACM-ICPC 2019 Regionals Rank 10

Suransh Chopra

Software Engineer at Google | BTech Hons in CSE, Class of 2021, IIT Bhilai | ACM ICPC Regionals 2019 | Master at Codeforces

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

Istasis Mishra

MahaYoddha

Plus Group for batch 5HWDG9ZW

1.5 -month Programming batch that would enable intermediate-level coders to upskill themselves and become experts. This batch will cover topics like Advanced Mathematics, Advanced Dynamic Programming, Segment Trees, and Advanced Graphs, thereby helping you to solve complex problems in the most optimized manner. During this 2-month course, you will have LIVE classes from educators who have proven experience with some of the world's best technology teams at Google, Microsoft, Flipkart, Rippling, AppDynamics, and LinkedIn, to name a few. Some other exclusive features that come with this batch are Structured Learning, Post Class Doubt Support in Discord, and Curated Practice Problems. To know more about the tentative topic-wise curriculum of this batch, please copy the following link and paste it in your browser:-https://bit.ly/mahayoddhabatch

Mahayoddha 4.0: 6-Week Mastercourse on Advanced Programming Topics

Intermediate

Square Root Decomposition

Segment Trees

Advanced Dynamic Programming

Advanced Combinatorics

Low latency engineer Nference.AI|Past DataEngineer LG ADS| IITBHU(CSE)|Past Instructor@Scaler academy|Past Instructor @Programming Pathshala

Robin Khurana

Plus Group for batch I0UGODZH

A 2-month programming batch that would enable intermediate-level coders to upskill themselves and become experts. This batch will cover topics like Advanced Mathematics, Advanced Dynamic Programming, Segment Trees, and Advanced Graphs, thereby helping you to solve complex problems in the most optimized manner. During this 2-month course, you will have LIVE classes from educators who have proven experience with some of the world's best technology teams at Google, Microsoft, Flipkart, Rippling, AppDynamics, and LinkedIn, to name a few. Some other exclusive features that come with this batch are Structured Learning, Post Class Doubt Support in Discord, and Curated Practice Problems. To know more about the tentative topic-wise curriculum of this batch, please copy the following link and paste it in your browser:-https://unacademy.cc/mahayoddhabatch

MahaYoddha 3.0: 2-Month Mastercourse on Advanced Programming Topics

Plus Group for batch R5RT1YMN

A 2-month programming batch that would enable intermediate-level coders to upskill themselves and become experts. This batch will cover topics like Advanced Mathematics, Advanced Dynamic Programming, Segment Trees, and Advanced Graphs, thereby helping you to solve complex problems in the most optimized manner. During this 2-month course, you will have LIVE classes from educators who have proven experience with some of the world's best technology teams at Google, Microsoft, Flipkart, Rippling, AppDynamics, and LinkedIn, to name a few. Some other exclusive features that come with this batch are Structured Learning, Post Class Doubt Support in Discord, and Curated Practice Problems. To know more about the tentative topic-wise curriculum of this batch, please copy the following link and paste it in your browser:- https://unacademy.cc/mahayoddhabatch

Mahayoddha 2.0: 6-Week Mastercourse on Advanced Programming Topics

Plus Group for batch Y006OKD3

MahaYoddha: 2-Month Mastercourse on Advanced Programming Topics

Batches

In this course, Saptarshi Mukherjee will be covering handpicked problems on advanced concepts comprising Advanced Dynamic Programming, Segment Trees, Advanced Mathematics, and Advanced Graphs. These concepts and problem-solving techniques are quite crucial in solving medium-hard problems on Competitive Programming on popular platforms like ACM-ICPC. The sessions will be conducted in English and the notes as well will be provided in English. 

Course on Handpicked Problems on Advanced Topics

Mixed Problem Solving & Doubt Clearing Session

In this course, Saptarshi Mukherjee will be covering advanced concepts on Advanced Graph Theory and Problem-Solving. These are quite crucial in solving medium-hard problems on Competitive Programming on popular platforms like ACM-ICPC. The sessions will be conducted in English.

Course on Advanced Graphs

Doubt Clearing Session

Advance Graph Algorithms

In this course, Saptarshi Mukherjee will be covering advanced concepts comprising Advanced Dynamic Programming, Segment Trees, and Advanced Graphs. These concepts are quite crucial in solving medium-hard problems on Competitive Programming on popular platforms like ACM-ICPC. The sessions will be conducted in English.

Course on Advanced Dynamic Programming, Segment Trees & Advanced Graphs

Doubt Clearing Session and Problem Solving

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.

Course on Advanced Mathematics in Programming

Doubt Clearing Session and Mixed Problem Solving

In this course, Saptarshi Mukherjee will be covering handpicked problems on advanced concepts comprising Advanced Dynamic Programming, Segment Trees, and Advanced Graphs. These concepts and problem-solving techniques are quite crucial in solving medium-hard problems on Competitive Programming on popular platforms like ACM-ICPC. The sessions will be conducted in English.

Saptarshi Mukherjee

Star

•

433 Followers

Free Classes

Concept of Disjoint Set Union

CSES ProblemSet on Graphs Part X

CSES ProblemSet on Graphs Part IX

Codeforces Round 735 Discussion: Problems A - D

CSES ProblemSet on Graphs Part VIII

CSES ProblemSet on Graphs Part VII

Batches

Competitive Programming

Course on Handpicked Problems on Advanced Topics

Course on Advanced Graphs

Course on Advanced Dynamic Programming, Segment Trees & Advanced Graphs

Course on Advanced Mathematics in Programming

Course on Handpicked Problems in Advanced Topics

Saptarshi Mukherjee

Star .css-1icgrfo-StyledTypography{font-weight:600;text-transform:initial;}.css-kc26im-StyledTypography{margin:0;color:var(--color-text-secondary);font-weight:600;text-transform:initial;}

•

433 Followers

Free Classes

Concept of Disjoint Set Union

CSES ProblemSet on Graphs Part X

CSES ProblemSet on Graphs Part IX

Codeforces Round 735 Discussion: Problems A - D

CSES ProblemSet on Graphs Part VIII

CSES ProblemSet on Graphs Part VII

Batches

Competitive Programming

Course on Handpicked Problems on Advanced Topics

Course on Advanced Graphs

Course on Advanced Dynamic Programming, Segment Trees & Advanced Graphs

Course on Advanced Mathematics in Programming

Course on Handpicked Problems in Advanced Topics

Star