ICPC World Finalist 2012 & 2013, Coach @ IOITC

Arjun Arul

Codeforces: 2246 | Codechef: 2416 | Former Intern @CodeNation, @HackerRank

Pulkit Chhabra

India

Nishchay Manwani

Plus Group for batch U7YPI1KP

This 10-Month concise batch will provide intermediate learners with deep subject matter expertise required to get placed in FAANG companies and crack international coding contests. This batch comes with detailed coverage of each topic (from intermediate to advanced) along with curated problem solving to accelerate your programming journey and get you ready for a prestigious career in technology. It comes with a pedagogy that is exclusively designed to help you develop the acumen required for solving any programming problem in the most optimized way. The educators of this batch are highly competent technical minds with ICPC world finals, IOI medals, IOI team training experience, and Codeforces Grandmasters as accolades. They are also alumni of sought-after tech companies like Google, Linkedin, Flipkart, AppDynamics to name a few. You will also be receiving industry-accepted Codechef certification upon successfully clearing the test attempt that comes free with a 6-month and 1-year subscription.
Given below are the prerequisites required to attend this course. You may refer to the following links, brush up the prerequisites and then attend the classes.
Loops : https://unacademy.com/course/building-blocks-of-programmimg/M41P089I   (Week 3 and Week 4)
STL : https://unacademy.com/course/standard-template-library/VE6QV4E2
Time complexity : https://unacademy.com/class/introduction-to-complexity-theory/VIIU2M59

Competitive Programming

Ascend: Intermediate to Expert Level Coder in 10 Months

Modulo arithmetic is a very well known topic in competitive programming. Many problem authors assume that participants already know about this. In this onw hour session, we are going to discuss this topic until modulo inverse.

Modulo Arithmetic

Intermediate

Number Theory

This is the official video editorial of the CodeChef February Lunchtime 2021 problem, Minimum Divisibility Set  (Problem Code : MDIVSET), which was kept as the second hardest problem in Division 1.

Minimum Divisibility Set (MDIVSET) | February Lunchtime 2021

Expert

Advance Graph Algorithms

Chinese Remainder Theorem, commonly known as CRT, is a very powerful tool in number theory which is also required in many competitive programming problems. In this one hour session, we are going to study CRT in its entirety and look at some problems.

Chinese Remainder Theorem

Advanced

Advanced Number Theory

Fenwick tree or binary indexed tree allows us to answer range queries like prefix sums, but also while performing point updates, i.e., changing some value in our data. It is much simpler and faster than its brother - segment tree, though not as flexible. In this class, we are going to look at how it works by using it in some problems.

Fenwick Tree and problem solving

Segment Trees & BIT

Prime numbers play a central role in almost all problems in number theory. In this session, we are going to look at how to find out if a number is prime or composite, a domain of algorithms known as primality tests.

Primality tests - finding if a number is prime

In this course, Nishchay Manwani will discuss the important topics under computational geometry and algorithms associated with it. The course would be helpful for aspirants preparing for Programming. Learners at any stage of their preparation will be benefited by the course. The course will be covered in Bilingually (Hindi and English) and the notes will be provided in English.

Course on Computational Geometry

Problem Solving and discussion session

In this course, Nishchay Manwani will discuss the important topics under number theory and algorithms associated with it. The course would be helpful for aspirants preparing for Programming. Learners at any stage of their preparation will be benefited by the course. The course will be covered in Bilingual langugae (Hindi and English) and the notes will be provided in English.


Course on Introduction to Number Theory

Extended Euclid GCD Algorithm - solving linear diophantine equations

In this course, Nischay Manwani will discuss all of the important STL containers and functions, while also analyzing the internal implementation and time and space complexity of each function. The sessions will be conducted in English and notes will also be provided in English.

Course on Standard Template Library

Mixed Problem Solving & Doubt Clearing Session

Additional Concepts in C++

In this session, we will look at what is MO's algorithm, which is a popular algorithm in the squareroot decomposition paradigm.  We will discuss when it can be applied and also solve a couple of problems based on it.

MO's algorithm - theory and problem solving

Square Root Decomposition

English

Learner Profile

Legend

Master

Star

Rising Star

Everest-C++ : Complete Course on Competitive Programming

Beginner

Basic Data Structures

Sorting & Searching Algorithms

Greedy Algorithms

Dynamic Programming & Recursion

Graph Algorithms

Building Blocks of Programmimg

Programming Fundamentals in C++

Discrete Mathematics

Segment Trees

Advanced Dynamic Programming

Computational Geometry

Batches

Plus

Special classes

Special Classes

Indian Institute of Technology, Guwahati

Bhopal, Madhya Pradesh, India

Codechef : Seven Star & Codeforces : International Grandmaster 
& Codejam 2020 : Until round 3 and secured rank 267th globally & Kickstart 2020 : Got global ranks 21st in round C and 26th in round D

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. 

Nishchay Manwani

Ex-educator

Nishchay Manwani

Ex-educator

366K

Competitive Programming

Course on Introduction to Number Theory

Course on Computational Geometry

Course on Standard Template Library

Batches

Ascend: Intermediate to Expert Level Coder in 10 Months

View full schedule

Special Classes

Fenwick Tree and problem solving

Minimum Divisibility Set (MDIVSET) | February Lunchtime 2021

Chinese Remainder Theorem

Modulo Arithmetic

MO's algorithm - theory and problem solving

Primality tests - finding if a number is prime

No internet connection

Nishchay Manwani

Ex-educator

Nishchay Manwani

Ex-educator

366K

Competitive Programming

Course on Introduction to Number Theory

Course on Computational Geometry

Course on Standard Template Library

Batches

Ascend: Intermediate to Expert Level Coder in 10 Months

View full schedule

Special Classes

Fenwick Tree and problem solving

Minimum Divisibility Set (MDIVSET) | February Lunchtime 2021

Chinese Remainder Theorem

Modulo Arithmetic

MO's algorithm - theory and problem solving

Primality tests - finding if a number is prime

.css-8tavlo-InternetInfoImg{width:20px;height:20px;vertical-align:middle;margin-right:8px;}No internet connection

No internet connection