This is the 2nd class in the micro course "FFT in Polynomial operations and Advanced Combinatorics". Having covered polynomial multiplication using FFT in the previous class, we are now going to cover the various other stuff FFT allows us to do efficiently.
Join Here: http://bit.ly/3oGNe9N

In this class, Riya is going to take a deep dive discussing the KMP Algorithm. This class will include an introduction to KMP Algorithm, followed by its optimized implementation.
Join Here: https://unacademy.com/a/free-course-on-pattern-matching-algorithm

In this class, Sanket will discuss important interview problems, and how to get started. Learners preparing for interviews will be benefited from this session. The lecture will be covered in Hindi.
Join Here: https://unacademy.com/a/free-course-on-faang-interview-problems-new

In this session, Triveni will introduce shortest path algorithms and dive deeper into the Floyd-Warshall Algorithm. Some practice problems will also be provided. And, atleast one complete solution will also be provided at the end.
Join Here: https://unacademy.com/a/free-course-on-shortest-path-algorithms-2

This is the 3rd class in the micro course "FFT in Polynomial operations and Advanced Combinatorics". In this class, we are first going to look at what does stirling number of second kind actually means, and how it can be used in various combinatoric problems.
Join Here: https://unacademy.com/a/free-course-on-fft-in-polynomial-operations-and-advanced-combinatorics

The first day of Programmer's Guide To Ace DSA starts at 6 PM today! With 80% problem-solving and 20% theory, this three-day program will be the perfect place to learn about DSA. It will also be the perfect series if you're looking to update your knowledge on this subject.
Join Here: https://unacademy.com/a/programmers-guide-to-ace-DSA

The 2nd test of Triumph 2021 starts today at 2 PM. This test is the perfect way for you to learn and win, all at the same time. So make sure you don't miss out on this amazing opportunity.
Join Here: https://bit.ly/3ilId4i

The second day of Programmer's Guide To Ace DSA has started! Be it a beginner or advanced learner, we have something for everybody today. So if you're looking to update your knowledge on this subject, join here: https://unacademy.com/a/programmers-guide-to-ace-DSA

Are you a beginner in programming? Then Triumph 2021 is just the right test for you. The 2nd test starts in 30 minutes. Participate Now and win exciting prizes with a total worth of INR 1.25 Lacs.
Participate Now: https://bit.ly/3ilId4i

In this class, Vivek Chauhan will discuss some harder problems related to Meet In The Middle Algorithm with students. The session will be conducted in Hindi.
Join Here: https://unacademy.com/a/free-course-on-meet-in-the-middle-algorithm

In this session, Triveni will discuss Bellman-Ford algorithm which works for negative edge weights as well. Why Dijkstra's doesn't work? How to check negative cycles? Compare shortest path algorithms. Practice problems and solved examples included.
Join Here: https://unacademy.com/a/free-course-on-shortest-path-algorithms-2

The last day of Programmer's Guide To Ace DSA starts in 30 minutes!
With problem solving sessions for beginner, intermediate and advanced learners by the best educators, today will be the perfect way to strengthen your knowledge on this subject.
Join Here: https://unacademy.com/a/programmers-guide-to-ace-DSA

At CodeChef, we are always working to change the way programmers learn and solve problems. For the same, we are running a survey to understand your perception of CodeChef Problem Translations. Please fill this form to be a part of the survey: https://forms.gle/vzftbD2NK2oEj4vh8

Our next guest at Conversations With CodeChef is Gaurav Agarwal, Co-Founder & CTO at 1Mg. Listen to him talking about his journey. Keep your questions ready on Sunday, January 24, 3 PM IST sharp!⠀⠀
Register Here: http://bit.ly/38RZA9I
⠀⠀

Announcing class on Solving Easy Leetcode Problems. In this session, we will cover problems from Leetcode and explain the approach and solutions, so you can understand the thought process while taking these problems and arriving at the solution.
Join us here, tomorrow at 6 PM sharp: https://bit.ly/39FWV1T

Tech interviews are unlike any other job interview. It is a specialized and rigorous process with a lot of focus on your problem-solving skills and coding abilities. A systematic and thorough preparation is needed for cracking these, and you can easily ace them. Tech Interview Hacks with CodeChef will allow you to get all the necessary information required for such intricate interviews.
Register Here: https://bit.ly/2XYHEnm

Don't know about Segment Trees? Or confused with so many different types of segment trees? Learn to code one generic segment tree which can be quickly modified to almost any type of segment tree in this micro-course by Utkarsh Gupta. The course starts from the absolute beginner level so you need not know anything about segment trees to attend this
Join here: http://bit.ly/3qDlL9K

Announcing class on Factorization of a number in cube root time. In this class, we are going to see how to factorize a number in cube root time, as opposed to the normal square root time taken. This method sacrifices some information in order to bring the time complexity down. To learn this and many other methods join here: https://bit.ly/392mCKQ

Join us as we interact with Gaurav Agrawal, Co-Founder, and CTO of 1MG, this week in Conversations with CodeChef. Get to know about his inspirational journey and how he reached the pinnacle of his career.
Register here: http://bit.ly/38X6PNv