Plus Group for course 9G5O6CI3

In this session, we officially wrap up the IPC 2020 Programming Camp. We will share the experiences of the camp and take feedback on what went well and what could be improved for next time.

Closing Note for IPC 2020

English

In this course, Suresh Upadhyay will provide in-depth knowledge of Discrete Mathematics. The course will be helpful for aspirants preparing for Competitive Programming. 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 Hinglish and the notes will be provided in English.

Course on Discrete Mathematics

In this lecture we will cover the concept of string hashing using polynomial rolling hash functions. 

An elementary knowledge about number theory (i.e modulo arithmetic and modulo inverse) prior to this lecture is essential.

We will be covering in depth the implementation of string hashing, its analysis and its wide-spread application in many string-related questions.

String Hashing

Educator Nishchay Manwani is Seven star on Codechef and International Grandmaster on Codeforces. This session is oriented towards division 1 participants and is a part of a 3 day workshop, 'Indian Programming Camp', in which he will discuss the basics of Linear Algebra and how to use it in Competitive Programming. Specifically how to use linear algebra on XOR related queries.

Linear Algebra

In this lecture, we will discuss a trick called Persistent Centroid Decomposition. We will motivate the idea by looking at a hard problem and show how it can be easily solved by performing Centroid Decomposition on the given tree and then making the Centroid Tree Persistent.

Persistent Centroid Decomposition

In this class, Pulkit will give an introduction to trees, talk about different ways of representing trees and more. The session will be conducted in English.

Introduction to Trees

We will cover the basics of time and memory complexity from scratch. It will focus mainly on Big O analysis. It is meant for beginners and will help you understand how to quantify the efficiency of various algorithms.

Introduction to Complexity Theory

The class will cover basic topics related to Game Theory like two player complete information games, Sprague Grundy Theorem, etc. 

It will also include solving some sample problems.

Introduction to Game Theory

In this course, Nimisha Bansal will cover important concepts of English and this course would be helpful for aspirants preparing for Bank Exams. Learners at any stage of their preparation will be benefited from the course. The course will be covered in Hindi and the notes will be provided in English.

Complete Course on English for All Banking Exams - III

In this AMA session, Riya Bansal will share her journey into the world of programming and share tips and tricks to learn in the best way possible and answer any questions that the viewers might have.

AMA by Riya Bansal | Women in Programming

In this session, I will discuss the importance of Competitive Programming and share a roadmap to become an expert, for learners of all levels -- beginner, intermediate and advanced.

Roadmap to Competitive Programming

In this course, Sanket will cover important concepts of discrete mathematics. The course will be helpful for aspirants preparing for competitive programming exams. The language of communication will be Hindi and English.

We will discuss about some common mistakes that you can avoid in 1st and 2nd year of your college. Some important things that you can explore and how to manage a lot of things along with your academics.

Lists of Mistakes to avoid in 1st and 2nd Year

In this course, Pulkit Chhabra will provide in-depth knowledge of Number Theory. The course will be helpful for aspirants preparing for Competitive Programming. 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 and the notes will be provided in English/Hindi.

Course on Number Theory

In this lecture we will introduced the concept of Centroid Decomposition on Trees and show how it can be used to solve different types of update and query problems on trees. We will also discuss the concept of Persistent Centroid Tree.

Centroid Decomposition

This session is oriented towards Division 3 participants and is a part of a 3-day workshop, 'Indian Programming Camp'. In this class, we will take a problem-solving approach to learn the basic constructs of the C++ programming language.

Basic Programming Constructs & Problem Solving

 In this session, Tanuj will be providing a blueprint of the classes & activities that have been planned for you during the 2 days of the placement BootCamp

Welcome Note for Placement Bootcamp

Free Live Class

Competitive Programming

Miscellaneous

Intermediate

ICPC and IOI

Square Root Decomposition and Segment Trees

More from Tanuj Khattar

Solving Recurrence Relations And Applications In Time Complexity Analysis

Preposition - Part II

Solving Recurrence Relations

Prime Numbers: Primality Test and Factorization

Basic Data Structures

Graph Algorithms

Advanced

Beginner

Introduction to Programming in C++

Reading Comprehension

English Language

Bank Exams

Vocabulary

Grammar/Sentence Correction

Number Theory

Discrete Mathematics

Surya Kiran Adury

Arjun Arul

Pulkit Chhabra

Nishchay Manwani

Deepak Gour

Nimisha Bansal

Riya Bansal

Sanket Singh

Suresh Upadhyay

Software Engineer @ Google Quantum AI. 
ACM ICPC World Finalist - 2017, 2018. Indian IOI Team Trainer 2016-2018.  Worked @ Google, Facebook,

Closing Note for IPC 2020

Tanuj Khattar

Similar Classes

Introduction to Complexity Theory

Arjun Arul

Basic Programming Constructs & Problem Solving

Sanket Singh

Introduction to Trees

Pulkit Chhabra

Introduction to Game Theory

Surya Kiran Adury

AMA by Riya Bansal | Women in Programming

Riya Bansal

Lists of Mistakes to avoid in 1st and 2nd Year

Deepak Gour

Linear Algebra

Nishchay Manwani

String Hashing

Sidhant Bansal

More from Tanuj Khattar

Persistent Centroid Decomposition

Tanuj Khattar

Roadmap to Competitive Programming

Tanuj Khattar

Centroid Decomposition

Tanuj Khattar

Welcome Note for Placement Bootcamp

Tanuj Khattar

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Suresh Upadhyay

Course on Discrete Mathematics

Sanket Singh

Complete Course on English for All Banking Exams - III

Nimisha Bansal

No internet connection

Closing Note for IPC 2020

Tanuj Khattar

Similar Classes

Introduction to Complexity Theory

Arjun Arul

Basic Programming Constructs & Problem Solving

Sanket Singh

Introduction to Trees

Pulkit Chhabra

Introduction to Game Theory

Surya Kiran Adury

AMA by Riya Bansal | Women in Programming

Riya Bansal

Lists of Mistakes to avoid in 1st and 2nd Year

Deepak Gour

Linear Algebra

Nishchay Manwani

String Hashing

Sidhant Bansal

More from Tanuj Khattar

Persistent Centroid Decomposition

Tanuj Khattar

Roadmap to Competitive Programming

Tanuj Khattar

Centroid Decomposition

Tanuj Khattar

Welcome Note for Placement Bootcamp

Tanuj Khattar

Similar Plus Courses

Course on Number Theory

Pulkit Chhabra

Course on Discrete Mathematics

Suresh Upadhyay

Course on Discrete Mathematics

Sanket Singh

Complete Course on English for All Banking Exams - III

Nimisha Bansal

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

No internet connection