Goal

Competitive Programming

Show only

Plus

Special classes

Batches

Filter by

All courses

Ongoing

Upcoming

Completed

Language

All languages

English

Hindi

Topic

All topics

Beginner

Miscellaneous

Expert

Advanced

Intermediate

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)

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

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)

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

Greedy Algorithms are of various types. In this lecture, we'll be discussing what they are, and how do we identify them. Followed by that, we'll be discussing some standard greedy algorithm based problems.

Greedy Algorithms: Basics

In this lecture, I'll be explaining how to find answer modulo 10^9+7 or some other number and also explain why 10^9+7 is so famous.

Modular Arithmetic (10^9+7)

Number Theory

In this lecture I'll be talking about the different features of Standard Template Library in C++. Which will be useful in Competitve Programming. This is a beginner oriented lecture (prerequisite is basics of C++).

STL: The Power of C++

In this 1 hour lecture, the basics of geometry will be discussed. The aim is to reduce the fear of geometry. We'll be discussing things like points, lines, polygons, circles, colinearity, area of polygons etc

Geometry (Basics) for Competitive Programming

Computational Geometry

Digit DP is a famous technique used in a lot of problems. In this lecture, we'll see how to identify and solve digit dp problems.

Digit DP and Variations

Dynamic Programming & Recursion

In this 60 minute lecture, we'll see a brief introduction of gaussian elimination and talk about 2 special cases of that: Markov Chains and XOR basis. Xor basis is a topic that is becoming popular in recent times.

XOR Basis/Gaussian Elimination

Advanced Maths

Legend

Master

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

Utkarsh Gupta

Rising Star

•

4K Followers

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)

Greedy Algorithms: Basics

Modular Arithmetic (10^9+7)

STL: The Power of C++

Geometry (Basics) for Competitive Programming

Digit DP and Variations

XOR Basis/Gaussian Elimination

Utkarsh Gupta

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

•

4K Followers

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)

Greedy Algorithms: Basics

Modular Arithmetic (10^9+7)

STL: The Power of C++

Geometry (Basics) for Competitive Programming

Digit DP and Variations

XOR Basis/Gaussian Elimination

Rising Star