Meet Triveni Mahatha - An IIT Kanpur graduate, a 6-star coder at CodeChef and a CM on CodeForces, Former SDE at Rippling and an ICPC 2016 World Final Qualifier.
For the 3rd day of the National Fiesta, join Triveni as he discusses Strategies to Master Competitive Programming. See you at 8 PM today!
Join Here: https://bit.ly/39Sbgu5

Popularized by movies such as "A Beautiful Mind," game theory is the mathematical modeling of strategic interaction among rational (and irrational) agents. This course will cover basics and introduction to game theory, like states, moves, sample problems. It will cover variety of puzzles to understand the foundational ideas.
Tune in at 7 PM today for the first class, 'Basics and Introduction to Game theory in CP'.
Visit: https://unacademy.com/a/free-course-on-game-theory

In this Micro Course, Sanket will be discussing an in-depth analysis of the graph interview problems. In this three-class micro-course, we will start from the medium-level graph problem discussion to advanced level problem-solving. The course will include coding implementations for the data structure and home assignment problems as well.
The first class begins at 8:30 PM today.
Visit: https://unacademy.com/a/free-course-on-graph-interview-problems

If you think that binary search can only be used to find a number in a sorted array, then this mini-course is just for you. We will explore the basic concept of binary search, complexity analysis, how to convert a problem to its boolean counterpart, and then apply binary search over the range of answers. We will also discuss some challenging problems from FAANG interviews, past Codeforces/CodeChef rounds, and ICPC regionals.

In the first class, we will discuss some fundamental aspects of binary search, i.e., what BS is, the conditions to use BS, complexity analysis, and some common problems.
Join the class at 6:30 PM today: https://bit.ly/3glR5pw

The second class of the free course on Graph Interview Problems will comprise of important problem solving of hard level problems.
Join the class today at 8:30 PM IST: https://bit.ly/3qzEF1U

Join Nishchay Manwani for a special class on Matrix Exponentiation on December 9, 3 PM IST. In this class, we will discuss and implement some Matrix Operations up until Matrix Exponentiation. We will also see some problems based on this concept.
Set a reminder for the class here: https://bit.ly/3oBdIca

The second class of this course will cover the discussion of idea, problems based on Nim game and minimax algorithm. There will be variety of examples to deepen the understanding.
Join the class at 7 PM IST, today: https://unacademy.com/a/free-course-on-game-theory

Micro Course on Segment Trees will begin from tomorrow. The first session will be about the basics of Segment Trees. This is going to be a beginner friendly session in which Segment Trees will be built from scratch. Join here at 9:00 PM IST -
https://www.unacademy.com/a/free-course-on-segment-trees

Micro Course on Discrete Binary Search will start tomorrow. In this class there will be discussions on binary search from past codeforces/codechef rounds. Join here: https://bit.ly/3glR5pw. Starts Tomorrow at 6 PM Sharp!

Popularized by movies such as "A Beautiful Mind," game theory is the mathematical modeling of strategic interaction among rational (and irrational) agents. This course covers basics and introduction to game theory, like states, moves, sample problems. It will cover variety of puzzles to understand the foundational ideas.
Tune in at 7 PM tomorrow for the fourth class.
Visit: https://bit.ly/37UG1M8

An Essential Guide to becoming a Certified Competitive Programmer is today. We will cover a range of topics from Roadmap to Competitive programming, Contest Taking strategy on online judges, List of mistakes to avoid in first and second year and how to crack interviews.
Register now: https://bit.ly/3434PAu

An Essential Guide to becoming a Certified Competitive Programmer is starting in 30 mins.
Join Now: https://bit.ly/348IPEf

#codechef #unacademy

The first class of Micro course on Dynamic Programming for Olympiad of Informatics starts Tomorrow. We will be covering how to approach dynamic programming problems from past INOIs and IOI-TCs. The aim would be to cover the algorithmic approach, the reason why correct, the reason how fast it is, and implement it.
Join here: https://bit.ly/2W0rTeS

Course on Recursions Masterclass starts Tomorrow. In this Micro Course, Sanket will be discussing an In-depth analysis of Recursion. Starting from the implementation of the Easy problems to the implementation of Advanced and expert level algorithms problems will be discussed.
Join here: https://bit.ly/37dM4fT

In this class, Riya will be discussing the basics of Hashing. In this beginner friendly session, we will build Hashmap from scratch and understand this concept.
Join Here: https://bit.ly/34hWXv1

In this class, Pulkit Chhabra will discuss Dijkstra's Algorithm and some beautiful problems related to it, with students. The session will be conducted in Hindi.
Join Here: https://bit.ly/34j446y

In the 2nd class of this micro-course, we will be covering how to approach dynamic programming problems from past INOIs and IOI-TCs. The aim would be to cover the algorithmic approach, reason why it is correct, reason how fast it is and implement it.
Join Here: http://bit.ly/2W0rTeS

In this micro course, Sanket will be discussing in-depth concepts of recursion and problem solving via recursion. The second class of the course will comprise of important problem solving of easy level in recursion.
Join Here: http://bit.ly/37dM4fT

In this class, Pulkit Chhabra will discuss Bellman Ford Algorithm and some beautiful problems related to it, with students. The session will be conducted in Hindi.
Join Here: http://bit.ly/3ajL0ZR

In this class, Riya will be discussing a lot of problems of intermediate level for Hashing. The discussed problems will be important from the perspective of Interview Preparation.
Join Here: http://bit.ly/3a2tucl