Legend

Master

Expert

Star

Rising Star

India

CSE at IIT BHU

Lucknow, Uttar Pradesh, India

Red on Codeforces

7* on Codechef

Best rank 16th (India Rank 2) in Google Kickstart

Uber SWE Intern

WOW! You are part of an elite few with this rare accomplishment. Our hats off to you!

50k minutes

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

Your first century, you did it! Go ahead, tell the world. 

100 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

Utkarsh Gupta

In this course, we'll be first seeing about String Trie and then about Binary Trie, then we'll see how to support min/max xor operations on it.

Trie and Binary Trie (with min/max xor)

Intermediate

Basic Data Structures

In this lecture, we'll be talking about Binary Trees from an Interview perspective. Topics like Inorder, Preorder, Postorder traversal and related stuff.

Binary Trees for Interviews

Advanced

Graph Algorithms

In this lecture, we will be solving more problems related to Maths in CP and doubts from the previous lecture will also be discussed and resolved.

Math based CP Problems - 2

Discrete Mathematics

In this lecture, we'll be approaching and solving  competitive programming problems that are based on Mathematics and require mathematical concepts. We'll see how to approach and solve these.

Math based CP Problems

In this lecture, we'll be talking about more features of STL, like comparators, and also about more containers like map, unordered_set, queue, etc. The use cases and time complexities of these will be talked about.

STL in C++ (Part 2)

Beginner

Introduction to Programming in C++

This is in continuation to the greedy basics lecture. In this lecture, I will discuss the approach of some handpicked greedy problems. Learners are supposed to watch this class to understand how to identify and approach greedy algorithm based problems.

Greedy: Problemsolving (Easy)

Greedy Algorithms

Free Classes

Ex-SDE @ LinkedIn | Former SDE @ Interviewbit | Google Summer of Code 2019 @ Harvard University | Former Intern @ISRO

Sanket Singh

I'm a competitive programmer. I am red on CF and 7* on Codechef. I have been teaching CP on various platforms for approx a year.

Yoddha

Plus Group for batch 3PEITUUD

A 6-month programming batch that would enable intermediate level coders to upskill themselves and become experts.This batch will help you to improve your ranking in programming platforms like Codeforces/ Codechef as you will be able to solve complex problems in the most optimized manner. During this 6-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- http://unacademy.cc/yoddhabatchcarriculam

Yoddha: Intermediate to Advanced Programmer in 6 Months

Square Root Decomposition

Number Theory

Dynamic Programming & Recursion

Segment Trees

Advanced Dynamic Programming

Computational Geometry

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

Istasis Mishra

Victor

Plus Group for batch U6WTAY17

Introducing our next batch, Victor: Concise Course for Intermediate & Advanced  Programmers, which begins on 31st May. The 6-month long batch will be based on C++, and cover the following prime topics: Greedy Algorithms, Advanced-Data Structure, Number Theory, Discrete Mathematics, Graph Algorithms, Advanced Dynamic Programming, and Computational Geometry.

Victor: Concise Course for Intermediate Programmers

String Algorithms

Expert Data Structures

Everest-C++ : Complete Course on Competitive Programming

Plus Group for batch HU1PWNVF

Introducing Gladiator, an 8-month batch for your ultimate transition from an intermediate to expert level coder is here! The course starts on May 3rd and is suitable for Intermediate and Advanced level coders. The course coverage includes (illustrative and not exhaustive) - Advanced Concepts in C++, Greedy Algorithms, Advanced-Data Structure, Number Theory, Discrete Mathematics, Graph Algorithms, Advanced Dynamic Programming & Computational Geometry.

During this 8-month course, you will have LIVE classes from educators who have already proven their expertise in prestigious competitions like ICPC and IOI. They have worked with some of the world's best teams at Google, Microsoft, Flipkart, Rippling, App Dynamics, LinkedIn, and many more. You will also be supported by dedicated Teaching Assistants (TA) who themselves are qualified programmers. Doubt resolutions via dedicated sessions, Discord server interactions, and during-the-class will be a constant activity. If you need more information about this batch, email learncp@codechef.com.

Gladiator: Transition from Intermediate to Expert Programmer in 8 Months

Additional Concepts in C++

Sorting & Searching Algorithms

Building Blocks of Programmimg

Programming Fundamentals in C++

Software Engineer at Microsoft | Ex - Flipkart | Former SDE and Instructor @ InterviewBit | Google Women TechMakers Scholar 2018

Riya Bansal

Everest-Java : Complete Course on Competitive Programming

Plus Group for batch O84LMVSE

Introducing UPRISE, an 8-month long complete course on transitioning from JAVA to C++. 
Batch Starts: 26th of April.
Batch Duration: 8 months
Pre-requisites: Existing knowledge about programming concepts in JAVA.
Course Coverage:
Moving to C++ from JAVA
Advance concepts in C++
Game Theory & Greedy Algorithms
Advanced-Data Structure
Number Theory
District Mathematics
Graph Algorithms
String Algorithms
Advanced Dynamic Programming
Computational Geometry
During these 8 months, you will have LIVE classes from educators who have already proven their expertise in prestigious competitions like ICPC and IOI. They have worked with some of the world's best teams at Google, Microsoft, Flipkart, Rippling, App Dynamics, LinkedIn, and many more. You will also be supported by dedicated Teaching Assistants (TA) who themselves are qualified programmers. Doubt resolutions via dedicated sessions, Discord server interactions, and during-the-class will be a constant activity. If you need more information about this batch, email learncp@codechef.com.



UPRISE: Complete Course on Transitioning from JAVA to C++

Programming Fundamentals in Java

Batches

In this course, Utkarsh will discuss Square Root Decomposition. This course would be helpful for students interested in Competitive Programming. The sessions will be conducted in English and notes will also be provided in English.

Utkarsh Gupta

Rising Star

in Competitive Programming

1M

3K

4K

27

Free Classes

Trie and Binary Trie (with min/max xor)

Binary Trees for Interviews

Math based CP Problems - 2

Math based CP Problems

STL in C++ (Part 2)

Greedy: Problemsolving (Easy)

Batches

Competitive Programming

Course on Square Root Decomposition

Educator highlights

Worked at
Uber SWE Intern

Studied at
CSE at IIT BHU

Red on Codeforces

Lives in
Lucknow, Uttar Pradesh, India

Unacademy Educator since
4th January, 2021

Knows
Hindi and English

View more

Utkarsh Gupta

Rising Star

in Competitive Programming

1M

3K

4K

27

Free Classes

Trie and Binary Trie (with min/max xor)

Binary Trees for Interviews

Math based CP Problems - 2

Math based CP Problems

STL in C++ (Part 2)

Greedy: Problemsolving (Easy)

Batches

Competitive Programming

Course on Square Root Decomposition

Educator highlights

.css-12zk6vg-P1-BaseText{font-weight:normal;font-size:14px;line-height:150%;color:var(--color-text-primary);margin:0px;display:inline;color:var(--color-text-primary);}Worked at Uber SWE Intern

Studied at CSE at IIT BHU

Red on Codeforces

Lives in Lucknow, Uttar Pradesh, India

Unacademy Educator since 4th January, 2021

Knows Hindi and English

View more

Worked at
Uber SWE Intern

Studied at
CSE at IIT BHU

Lives in
Lucknow, Uttar Pradesh, India

Unacademy Educator since
4th January, 2021

Knows
Hindi and English