Goal

Competitive Programming

Show only

Plus

Special classes

Batches

Filter by

All courses

Ongoing

Upcoming

Completed

Language

All languages

English

Hinglish

Topic

All topics

Beginner

Miscellaneous

Expert

Advanced

Intermediate

Today we will be learning about greedy algorithms. Some classic proof techniques and standard problems will help get a better understanding of greedy algorithms!

Greedy algorithms for Interview Prep

Greedy Algorithms

Today we will solve a few problems using concepts in number theory like modular arithmetic, sieve of Eratosthenes and Euler Totient Function. We will learn about these concepts while solving the problems!

Problem Solving in Number Theory (Part 2)

Number Theory

Today we will be solving some problems using DFS along-with their implementation. This will help improve our understanding of the DFS algorithm on trees and graphs.

Applications of DFS (Part 4)

Graph Algorithms

Applications of DFS (Part 3)

Applications of DFS (Part 2)

Today we will be solving some classical problems using DFS along-with their implementation. This will help improve our understanding of the DFS algorithm.

Applications of DFS (Part 1)

Combinatorics is one of the most popular math topics in competitive programming, no matter if you are preparing for interviews or competitions. And to top that, it does not have to be difficult! The only prerequisite to learn combinatorics is high school mathematics.

Combinatorics (Part 1)

Advanced Combinatorics

Combinatorics (Part 2)

Today we will be learning about an efficient pattern finding algorithm called Knuth-Morris-Pratt or KMP algorithm. This is the most basic pattern finding algorithm out there and the most popular as well.

String algorithms I - KMP algorithm

String Algorithms

Today we will learn about binary search, one of the most popular searching methods. Binary search can be used in ways other than searching an element in the array and much cleverly solve some problems!

Binary Search (Part 2)

Sorting & Searching Algorithms

Binary search (Part 1)

This is a miscellaneous problem solving session where we are not bounded by any topics. We will solve three problems on codeforces rated anywhere from 1600 to 2000!

Problem solving session

Legend

Master

Star

Rising Star

India

Hyderabad and Rangareddi, Telangana, India

International participant in the International Olympiad of Informatics, 2018

Participant in the International Olympiad of Informatics, 2018

Delhi Public School, Ruby Park

IIIT Hyderabad

International Institute of Information Technology

Woohoo! You’re officially a learning rockstar. Keep racking up more thousands!

1000 minutes

Dedicate this special Teachers’ Day Hat to appreciate the efforts of your favorite educator

Happy Teachers' Day Hat 2021

Istasis Mishra

Rising Star

•

1K Followers

Greedy algorithms for Interview Prep

Problem Solving in Number Theory (Part 2)

Applications of DFS (Part 4)

Applications of DFS (Part 3)

Applications of DFS (Part 2)

Applications of DFS (Part 1)

Combinatorics (Part 1)

Combinatorics (Part 2)

String algorithms I - KMP algorithm

Binary Search (Part 2)

Binary search (Part 1)

Problem solving session

Istasis Mishra

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

•

1K Followers

Greedy algorithms for Interview Prep

Problem Solving in Number Theory (Part 2)

Applications of DFS (Part 4)

Applications of DFS (Part 3)

Applications of DFS (Part 2)

Applications of DFS (Part 1)

Combinatorics (Part 1)

Combinatorics (Part 2)

String algorithms I - KMP algorithm

Binary Search (Part 2)

Binary search (Part 1)

Problem solving session

Rising Star