Nishchay gets one problem and Udit gets one too. But the difference in score is 300. Watch to find who's leading

Dhruv Sharma (International Institute of Information Technology, Hyderabad), Ritika Singh (Netaji Subhas University of Technology), Pranav Nair (NIT, Guwahati), and many more have something in common. Curious? Check out the blog to know more, and maybe you will see your name as well!
https://bit.ly/2YtdkF5

SnackDown 2021 is here, and the registrations are open now: https://bit.ly/3yEtsQB! Join us as we go down the memory lane and share some exciting facts about the competition with you.

Your attitude and resume define who you are, and that's why you need to present your best: https://bit.ly/3kYFQWA. Build your very best with our educators. From choosing the correct project to improving your technical skills, they will help you out in all stages. Get access to all this for just Rs 83 per month for a one-year subscription. Use discount code: CODECHEF

Happy Teachers' Day to everyone out there who went an extra mile for us! Let it be your Kindergarten teacher who taught you maths, or your professor who made sure you understood DSA; every teacher shapes your life in a specific way. We at CodeChef thank all our teachers on Discuss, YouTube, our Video Editorialists, and every expert who patiently helps a beginner to get started.

Chef is going on a road trip and needs to apply for inter-district and inter-state travel e-passes. It takes A minutes to fill each inter-district e-pass application and B minutes for each inter-state e-pass application.
His journey is given to you as a binary string S of length N where 0 denotes crossing from one district to another district, and 1 denotes crossing from one state to another.
Find the total time Chef has to spend on filling the various forms.
Solve the problem: https://bit.ly/3DRWv6M

#AnybodyCanCode is back again: https://bit.ly/2WPCMDS, and starting this September 6th is a 5-day series for newbies in Python. You will learn everything about basics, functions, loops, and even write your first code in Python.

Chef is given an array A consisting of N positive integers. Chef shuffles the array A and create a new array B of length N, where B_i = (A_i + i) mod 2, for each i(1 <= i <= N).
Find the maximum possible sum of integers of the array B, if Chef shuffles the array A optimally.
Solve the problem: https://bit.ly/3jOaP8I

Right mentors can set your path. Get access to various weekly live shows: https://bit.ly/3tgTNTJ on interview preparation, project reviews, technical competency building, and much more, just for Rs 83 per month for a one-year subscription. Use code CODECHEF for an extra discount.

In the next episode of 'DSA with Placements', Mohammad Fraz will continue with the Introduction to Trees: https://buff.ly/3DV2tEi. Tune in at 8 PM today.

Hurry Up! Guys
We are Live 🔴
https://youtu.be/a5f6kcPYfWM

Join Fast
We are Live 🔴
https://youtu.be/l_g3aH8WAVI

SnackDown is back this year, and it's bigger than ever: https://bit.ly/3l53f98! Did you know we also tweaked the competition a bit? Check out the blog to know everything, and register right away for the ultimate coding competition!
https://bit.ly/2VmzCXW