Goal

Competitive Programming

Show only

Special classes

Filter by

All courses

Ongoing

Upcoming

Completed

Language

English

Topic

All topics

Beginner

Miscellaneous

Expert

Advanced

Intermediate

In this series of classes, we'll solve many questions based on different topics such as Binary Search, Trees, Graphs, Dynamic Programming, Greedy and Constructive Algorithms.

Mixed Problem Solving Session

Graph Algorithms

In this class we would be solving problems on basic data structures like Arrays, Maps, Sets, Queue, Stacks, Heaps etc. We would also be discussing theory briefly as we solve the problems.

Problem Solving Session on Basic Data Structures

Basic Data Structures

This would be an AMA-style class, where we will be discussing internships and placements, both on-campus and off-campus, some last-moment strategies, how to attempt codings rounds and interviews, and more.

AMA on Placements & Internships | Last Minute Strategies

Interview Preparation

Dynamic Programming is one of the most asked topics in interviews. In this session, we would see how we can use dynamic programming to optimize our recursive solutions. We will solve problems with difficulty ranging from Medium - Hard.

Dynamic Programming - Problem Solving - Part 2

Dynamic Programming & Recursion

This will be an advanced class on Dynamic Programming. In this class, we would be learning Digit DP, and solving problems from SPOJ, Codechef, Codeforces, and LeetCode.

Digit DP - Advance Dynamic Programming

Advanced Dynamic Programming

In this session, we would be discussing Interview Problems asked in Amazon to one of my friends for the SDE1 position. The problems were based on Arrays, Dynamic Programming, and Graphs. I would be discussing the solutions along with the method to approach interview problems.

Amazon Interview Problems

In this class we will be looking at one of the basic concepts in DSA, sorting and searching. We will be going over all the common searching and sorting algorithms, see the difference between the time and space complexities of each of them as well as solve some problems on the same.

Introduction to Sorting and Searching

Building Blocks of Programmimg

Dynamic Programming is one of the most asked topics in interviews. In this session, we would see how we can use dynamic programming to optimize our recursive solutions. We will solve problems with difficulty ranging from Easy to Hard.

Dynamic Programming - Problem Solving

In this session, we would be discussing problems asked in Interview Rounds/Coding Rounds of Good Product Based Companies like Google, Facebook, Amazon, etc.

FAANG Interview Problems

Linked List is one of those topics which is asked quite frequently in interviews. In this session, we would discuss Linked List problems asked in good product-based companies.

Linked List - FAANG Interview Problems

Linked List is one of those topics which is asked quite frequently in interviews. In this session, we would be discussing linked lists from the very basic and also solve problems based on them.

Linked List Introduction

Graph problems are often asked in interviews and coding rounds, it is a data structure that is widely used in Competitive Programming as well. In this session, we would be learning about graphs, DFS, BFS, and their applications by solving related problems.

Graph Theory for Beginners - Part 1

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

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. 

Anuj Singh's courses