Legend

Master

Expert

Star

Rising Star

India

ABES Engineering College

Ghaziabad, Uttar Pradesh, India

Rated 5 stars at CodeChef & Expert at CodeForces.

KoverHoop 

Esper

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

10k 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

Umang Agrawal

In this session, Umang will discuss some important interview problems based on Linked List. Problems from basic range to hard range will be covered in the session.

Complete Interview Preparation for Linked List

Intermediate

Interview Preparedness

In this session, Umang will be discussing some important problems based on Heaps which are frequently asked in interviews. Implementation will be done in C++

Interview Preparation for Heaps

Expert Data Structures

In this session, Umang will be discussing about Heap Data Structure. Intuition and uses of Heaps will be done in the session along with some important problems as well.

Learn about Heaps

In this session, Umang will be discussing about LRU Cache(Least Recently Used Cache) which is an important concept in Operating Systems. This problem is frequently asked in interviews. The implementation will be discussed in C++

Learning LRU Cache along with implementation

Beginner

Operating System

In this session, Umang will discuss about Segment Trees implementation in C++. This is in continuation with the previous session named Basics of Segment Trees.

Implementing Segment Trees(Part 2 after basics)

Advanced

Segment Trees

In this session, Umang will be discussing some important interview questions based on Backtracking which are commonly asked in interviews. The implementation will be done in C++.

Interview Questions on Backtracking

Dynamic Programming & Recursion

Free Classes

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

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

Tarun Gupta

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++

Basic Data Structures

Sorting & Searching Algorithms

Greedy Algorithms

Square Root Decomposition

Number Theory

Graph Algorithms

Programming Fundamentals in C++

Discrete Mathematics

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

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, Umang will be teaching different topics starting from Memory Management, Object Oriented Programming to different libraries in C++ along with different Data Structures & Algorithms. The course will be helpful for aspirants preparing for Programming exams. Learners at any stage of their preparation will be benefited from the course. The course will be covered in Hindi & English and the notes will be provided in English.

Course on Additional Concepts in C++

Doubt Clearing Session

OOP Concepts

In this course, Umang Agrawal will discuss important concepts of Sorting and Searching. The course will be helpful for aspirants preparing for Programming exams. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hindi & English and the notes will be provided in English.

Course on Sorting and Searching

Doubt Clearing Session and Problem Solving

In this course, Umang Agrawal will discuss important concepts of Basic Data Structure in C++. The course will be helpful for aspirants preparing for Programming exams. Learners at any stage of their preparation will be benefited from the course. All doubts related to the topic will be clarified during the doubt clearing sessions in the course. Class dates and timings along with topic details are given below. The course will be covered in Hindi & English and the notes will be provided in English.

Umang Agrawal

Star

•

683 Followers

Free Classes

Complete Interview Preparation for Linked List

Interview Preparation for Heaps

Learn about Heaps

Learning LRU Cache along with implementation

Implementing Segment Trees(Part 2 after basics)

Interview Questions on Backtracking

Batches

Competitive Programming

Course on Additional Concepts in C++

Course on Sorting and Searching

Course on Basic Data Structure in C++

Umang Agrawal

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;}

•

683 Followers

Free Classes

Complete Interview Preparation for Linked List

Interview Preparation for Heaps

Learn about Heaps

Learning LRU Cache along with implementation

Implementing Segment Trees(Part 2 after basics)

Interview Questions on Backtracking

Batches

Competitive Programming

Course on Additional Concepts in C++

Course on Sorting and Searching

Course on Basic Data Structure in C++

Star