The Starters season for the month has begun, and the 15th edition is going to be here soon: https://bit.ly/3Dm8KaL. Rated for both Division 2 & 3 coders, the contest will go live on Tuesday, 12th October at 8 PM IST. So start your preparation now and give this your best shot.

Register for SnackDown 2021: https://bit.ly/3FoAqO7
Here are some of the Indian finalists of SnackDown 2019. abhishek_1997, hm_98, saharshluthra & gvaibhav21 of IIT Roorkee and sdnr1 & Aditya1701 of DTU share with us their experience of the contest, what they love about it, and how to get into the top 100.

Your resume reaches your interviewer way before you do, and that’s why it’s very important that you present your best. Learn from the industry expert Arsh Goyal on how to make your resume stand out amongst the crowd and beat the odds, today at 12 PM: https://www.youtube.com/watch?v=RTadRis8jCU. He will also discuss how to personalize your resume for your dream job or internship.

The Chef is at the Olympics. You are given the medal tally of N of the participating countries where countries are ranked lexicographically in order of their gold, silver, and bronze medals.
You are also given Q queries, each represented by a single integer K. For each such query, you need to find the best possible rank country 1 can achieve if you are allowed to take any K medals (possibly of different countries) and change their color: https://bit.ly/3lnrkt9.

Now is the time for you to work on your skills, do some last-minute preparation, and be all ready for the biggest coding challenge of the year, SnackDown 2021: https://bit.ly/3oNe7vA. 46k+ people have already registered, have you?

If you are interested in programming, here’s your golden chance to test your skills: https://bit.ly/3uTOuKJ! Compete against thousands on October 12th at 8 PM, and show the world what you have got.

SnackDown 2021 is special, as it is an individual contest: https://bit.ly/3oNe7vA - the most unique in the history of all SnackDowns. We miss what we were known for (hear this out from our past participants), but we look forward to this year's fun & challenge with a difference. Only 6 more days for qualifiers, and 10 days more for the registrations to end.

There are N hidden points in a 2-D plane. In one query you can ask the square of Euclidean distance between ith and jth points. Find the closest pair distance using at most 3 * N - 6 queries: https://bit.ly/2YDj53q.

Your ratings matter a lot, and many companies even hire you on the basis of your CP ratings. If you are feeling stuck or confused about how to proceed forward & increase your CodeChef star rating, then this is what you need to see: https://bit.ly/3lqZs7p. Tune in at 3 PM sharp today to learn from Umang Agarwal, a 5-star coder on CodeChef and SDE at Esper.

👉You can checkout https://bit.ly/3jUUuig the complete SnackDown 2021 Preparation Series Beginner to Advanced Level Playlist.

5 more days, and here comes SnackDown 2021! The qualifiers are about to begin: https://bit.ly/3uXIvEG, and if you haven’t still registered, do it right away: https://bit.ly/3FuC7JP.

Unleash the coder inside you, participate in Starters 15: https://bit.ly/3iOiNxD and take on the programming world with us on October 12th at 8 PM.

The October Long Challenge ends in a few hours. Wrap up 10 days of your hard work & solve those last few problems now: https://bit.ly/3uXln9o. The video editorials will be out soon, so stay tuned!

Understand and master one of the crucial topics in Data Structures; Queues. Tune in at 7 PM tonight, and learn from the best.

https://www.youtube.com/watch?v=yvxTxSe59RU

Tick Tock, Tick Tock! The time is running out, and this is your chance to register for the biggest coding challenge, SnackDown 2021!

https://bit.ly/3asLoDS

📢 October Long Challenge 2021 Official Problem Solutions Out ! ⚠️ https://bit.ly/3Apvy7P 👉 Check it out

If you are new to the Competitive Programming world, then this is the perfect opportunity for you to test out your skills. Come, join us for Starters 15, tomorrow at 8 PM.

https://bit.ly/2YB5V7d

Join us today at 10:30 PM for the 2nd episode of Heap: Data Structures: https://bit.ly/3AxkgOW where Mohammad Fraz will discuss Problem Solving on Heaps, HeapSort & the Heapify Method.

What's stopping you from participating in your first rated contest? Embark on your programming journey with us with Starters 15, today at 8 PM: https://bit.ly/2YHmU7b.

Are you ready to take on coders across the globe: https://bit.ly/3DCGAbw? The first qualifier starts in 3 days, so register now: https://bit.ly/3asmCE9!