Learn programming with CodeChef
10.5K subscribers
1.48K photos
14 videos
3 files
1.85K links
This is the official telegram group of CodeChef. We'll be posting updates regarding new courses, practice paths, upcoming contests etc.

Feel free to discuss anything and everything related to programming here!

Signup on CodeChef: https://bit.ly/3DypjkF
Download Telegram
👉Learn Binary Search Algorithm in 3 lectures by Arsh Goyal
Stay tuned with us: https://youtu.be/zUhUkExWv5Y
Media is too big
VIEW IN TELEGRAM
10 days for the SnackDown 2021 Qualifier to begin! Are you ready to experience the thrill, the intensity, and the heat of the competition? ICYMI, the registration is about to close: https://bit.ly/3ozvyj6. So hurry up, it's time for SnackDown!!
Being a leader & leading the way is a proud moment for anyone, ain't it? Well, here’s your chance to be CodeChef’s College Chapter leader! You can grow your college’s Competitive Programming community, engage with peers, solve questions together, and improve your leadership skills. If you feel like you would be a great fit here, then apply right away: https://bit.ly/2WGRq0s
You are given an integer N and a digit D. Find the minimum integer you should add to N such that the final value of N does not contain the digit D: https://bit.ly/3mlbz4U.
It is time to hit the pedal and get ahead in the race. Register for #SnackDown2021: https://bit.ly/3a87prH, compete against thousands on a global scale & be a part of the biggest online #coding challenge of the year.
Learn programming with CodeChef pinned «We are Live 🔴 Join fast https://youtu.be/FrrRSBaHJIk»
Media is too big
VIEW IN TELEGRAM
Here's what we found in our archives! Presenting Gennady Korotkevich & Borys Minaiev, the Champions of SnackDown 2019! The qualifiers for SnackDown 2021 will start in 9 days. So go & register if you haven’t already: https://bit.ly/3a87prH, & experience the thrill and glory of the biggest coding competition of the year.
The MEX (minimum excluded) of an array is the smallest non-negative integer that does not belong to the array.
You are given an array A of length N. You create a list B consisting of the MEX-es of all subarrays of the array A. Formally, for all pairs (l, r) such that 1 <= l <= r <= N, you calculate MEX(A_l, A_{l + 1}, ..., A_r) and append the value in the list B. Find the K-th smallest value in the list B: https://bit.ly/3alt937.
Just a few more days for the globally renowned challenge, SnackDown 2021 to begin! Are you ready for the ultimate race? Go, register now: https://bit.ly/3DycXbJ, if you haven’t already.
Media is too big
VIEW IN TELEGRAM
There are many reasons why you should not miss SnackDown 2021: https://bit.ly/3DycXbJ. Ilya and Artem from ITMO, St. Petersburg, Russia, are telling you why you should register for SnackDown. Only 8 more days left for the Qualifiers to begin! Registration ends on October 19th.
Given an array C of M integers and a square matrix A (with integer entries) of dimension N X N, verify whether the following equation is true,
(C_0 I_{N} + C_1 A + C_2 A^2 + ... C_{M-1} A^{M-1} \equiv 0_N) % 998244353
where 0_N is the square null matrix (matrix in which all elements are zero) and I_N is the identity matrix, both having dimensions N X N: https://bit.ly/3AkbGTe.
With only a week left, the Qualifier is just around the corner: https://bit.ly/2Ys9JH7, and it’s time to ramp up your preparation for SnackDown 2021. Register now: https://bit.ly/3FoAqO7!!