Legend

Master

Expert

Star

Rising Star

India

Indian Institute of Technology, Delhi

Google

Adobe

DE Shaw

Microsoft

Graduated with an Institute Silver Medal for scoring the highest grade point average in my major.

North West, Delhi, India

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

Competitive Programming

Tarun Gupta

In this interactive session, Tarun Gupta will quickly introduce learners to the idea of Dynamic Programming and then solve quite a few interesting problems. There is no prerequisite to learn from this session.

Demystifying Dynamic Programming

Intermediate

Dynamic Programming & Recursion

In this interactive session, we are going to solve some excellent problems on Graphs. The focus will be on the beginner-intermediate level, to build the robust fundamentals.

Live Problem Solving on Graphs

Advanced

Graph Algorithms

In this session, Tarun Gupta will introduce students to topological sorting and the class of problems that directly build upon this very concept. As a prerequisite, please plan to attend the previous session of the series: "Topological Sorting and Applications - I". A basic understanding of graphs and traversal would help follow the content.

Topological Sorting and Applications - II

In this session, Tarun Gupta will introduce students to topological sorting and the class of problems that directly build upon this very concept. A basic understanding of graphs and traversal would help follow the content.

Topological Sorting and Applications - I

In this interactive session, we will explore the world of strings and some elegant solutions around them to make our lives easy. This session is going to be beginner-friendly and doesn't have any set prerequisites.

Introduction to String Algorithms

String Algorithms

In this session, Tarun Gupta will start with an introduction to BFS and will talk about multi-source BFS towards the ending. This session doesn't require any particular prerequisites, a basic understanding of graphs would be helpful.

Multi-Source BFS

Free Classes

SDE Intern @Esper | CSE Final year | 5 Stars@ CodeChef | Expert @CodeForces | Former Intern @IIT Delhi @PrepBytes @KoverHoop @GFG

Umang Agrawal

Software Developer at Google || Past Experience : Amazon, Dunzo, Samsung || ACM -ICPC Regionalist 

Suresh Upadhyay

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

Sanket Singh

Arnab Chakraborty

SDE @ Google | IIT Delhi - Bachelors & Masters | Institute Silver Medalist | Join the community here t.me/tarungupta_unacademy

SDE @ Google || ex-Hackerrank Intern || GATE CSE AIR 3 || Masters at IIT Bombay || ACM ICPC Regionals || C. Master on Codeforces

Nipun Mittal

Adroit 2.0

Plus Group for batch MN77DNKM

Get set for a 9-month course designed to get you prepared for a rewarding career in programming. From Introduction to Computational Geometry, the batch uses C++  to cover exhaustive and extensive programming courses that every beginner can benefit from. The batch starts on June 8th, 2021. Please find more information here:
Topic-wise batch structure:
● Week 1 - 4: Introduction to Programming in C++
● Week 5 - 9: Sorting & Searching
● Week 10 - 13: Basic Data Structures - Fundamentals & Interview Specific Problem
Solving
● Week 14 - 17: Additional Concepts in C++
● Week 18 - 20: Greedy Algorithms with Classical Problem Solving
● Week 21 - 24: Advanced Data Structures:Square Root Decomposition & Compex
Problems
● Week 25 - 26: Number Theory & Interview Questions
● Week 27 - 28: Recursion on DP - Concept to Detail
● Week 29 - 32: Discrete Mathematics
● Week 33 - 37: Graph Algorithms: Fundamentals to Extensive Problem Solving
● Week 38 - 40: Segment Trees
● Week 41 - 43: Advanced Dynamic Programming
● Week 44 - 46: Computational Geometry

Adroit 2.0: 9-Month Career Readiness Batch for Beginners

Additional Concepts in C++

Beginner

Basic Data Structures

Sorting & Searching Algorithms

Greedy Algorithms

Square Root Decomposition

Number Theory

Programming Fundamentals in C++

Discrete Mathematics

Segment Trees

Advanced Dynamic Programming

Computational Geometry

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

Riya Bansal

Everest-C++ : Complete Course on Competitive Programming

Plus Group for batch 1KSB8N05

Hosted by two of our finest Educators, Riya Bansal and Arnab Chakraborty, our new batch, Everest 3.0: Complete Course on Programming, is set to commence from June 1, 2021. The 11-month batch is a comprehensive guide for any beginner who wants to understand the basics of programming and further build on their skill. Please find more information here. 



Everest 3.0: Complete Course on Programming

Building Blocks of Programmimg

Kushagra Nigam

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

Robin Khurana

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

Istasis Mishra

MTech from Delhi Technological University (DCE), currently working for Microsoft in Windows team. Also a mentor at Microsoft engage program.

Anjali Sheel

Striker

Plus Group for batch FQACEUWD

Take a deep dive into the fundamentals of Data Structures through solving problems carefully curated by our Top Educators. Batch Striker, starting May 31st, 2021, makes for a practical approach to learn DSA and is best suited for beginner-level coders. The 9-month long batch will be conducted in C ++. 



Some of the important topics to be covered in the batch are Basic Data Structures, Advanced Concepts in C++, Greedy Algorithms, Advanced-Data Structure, Number Theory, Discrete Mathematics, Graph Algorithms, Advanced Dynamic Programming, Computational, and  Geometry.

Striker: Data Structures Fundamentals with Curated Problem Solving

Plus Group for batch XZMVJBZK

From building blocks of programming to Sorting and Searching, from Advanced-Data Structures to Computational Geometry – 11 months to become a Coding, SAMURAI. Starting May 11, CodeChef will be hosting a beginner to an expert exhaustive list of programming concepts through a new Batch, SAMURAI.
The batch will be using C++ to understand programming science, be introduced to competitive programming, and pick up key techniques such as Sorting & Searching; understand BDS, and learn Advanced Concepts of C++.
Get Greedy Algorithms to solve problems step by step, and understand how to choose locally optimal options leading to global solutions. Move on to more Advanced Data Structures, solve super-problems with Recursion and Dynamic Programming; practice logic with Discrete Mathematics; understand data dynamics with Graph and String Algorithms. Finish big with a solid grip over Advanced Dynamic Programming and Computational Geometry – become the programming SAMURAI.
During this 11-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, AppDynamics, LinkedIn, and many more. You will also be supported by dedicated Teaching Assistants (TA) who themselves are qualified programmers. Use Live Doubt resolution and via dedicated sessions, and Discord server interactions for better learning. If you need more information about this batch, email learncp@codechef.com

SAMURAI: Beginner's Journey to Become an Expert Programmer

Batches

In this course, Tarun Gupta will cover the basics of recursion and build towards expertise in backTracking and dynamic programming. The course will be delivered in English, C++ will be used for all the problem solving and the notes will be provided in English.

Course on Recursion and Dynamic Programming

Doubt Clearing Session

In this course, Tarun Gupta will start from the basics of number theory and build towards expertise in the same. The course will be delivered in English and C++ will be used for all the problem solving and the notes will be provided in English.

Course on Number Theory

Problem Solving Session - III

Advanced Number Theory

In this course, Tarun Gupta will start from the basics of Graph data structure and build towards expertise in theory and algorithms. The course will be delivered in English, and C++ will be used for all the problem solving, and the notes will be provided in English.

Tarun Gupta

Star

in Competitive Programming

172K

150

1K

4

Free Classes

Demystifying Dynamic Programming

Live Problem Solving on Graphs

Topological Sorting and Applications - II

Topological Sorting and Applications - I

Introduction to String Algorithms

Multi-Source BFS

Batches

Competitive Programming

Course on Recursion and Dynamic Programming

Course on Number Theory

Course on Graph Algorithms

Educator highlights

Worked at
Google

Studied at
Indian Institute of Technology, Delhi

Graduated with an Institute Silver Medal for scoring the highest grade point average in my major.

Lives in
North West, Delhi, India

Unacademy Educator since
18th February, 2021

Knows
Hinglish, Hindi and English

View more

Tarun Gupta

Star

in Competitive Programming

172K

150

1K

4

Free Classes

Demystifying Dynamic Programming

Live Problem Solving on Graphs

Topological Sorting and Applications - II

Topological Sorting and Applications - I

Introduction to String Algorithms

Multi-Source BFS

Batches

Competitive Programming

Course on Recursion and Dynamic Programming

Course on Number Theory

Course on Graph Algorithms

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 Google

Studied at Indian Institute of Technology, Delhi

Graduated with an Institute Silver Medal for scoring the highest grade point average in my major.

Lives in North West, Delhi, India

Unacademy Educator since 18th February, 2021

Knows Hinglish, Hindi and English

View more

Worked at
Google

Studied at
Indian Institute of Technology, Delhi

Lives in
North West, Delhi, India

Unacademy Educator since
18th February, 2021

Knows
Hinglish, Hindi and English