All you need is the mindset to search and listen, and you will find answers to all your questions! Improve your projects, gain technical competency, understand the importance of CP ratings, and much more, with our weekly live shows: https://bit.ly/3jPC7eD. Get access to exclusive content from industry experts for just Rs 83 per month for a one-year subscription. Use discount code: CODECHEF.

🎯The Technical Interview Question series covers all the must-know questions that you need to learn to ace your technical interviews. In this, Saptarshi Mujherjee, SDE @ Google will talk about questions that have been asked multiple times in various top-notch company interviews like Google, Amazon, Microsoft, Facebook and many others. You will find all the essential concepts required for solving the question to writing the code to understand and learn all about the frequently asked interview questions.
🔸Here You can watch the complete Technical Interview Questions series playlist, click here : https://bit.ly/3Dj9P43

We hope to see more schools & colleges participate in SnackDown 2021. Hurry up, and register now:https://bit.ly/2WYqKrK!

You are given N distinct points in a 2-D plane, numbered 1 through N. Your goal is to make the location of all the N points equal. To achieve this, you can do some operations.
In one operation, you choose an index i(1 <= i <= N) and a real number K and change the location of the i^{th} point in one of the following ways:
- Set (X_i, Y_i) = (X_i + K, Y_i)
- Set (X_i, Y_i) = (X_i, Y_i + K)
- Set (X_i, Y_i) = (X_i + K, Y_i + K)
- Set (X_i, Y_i) = (X_i + K, Y_i - K)
Find the minimum number of operations to achieve the goal: https://bit.ly/3yS4kFW.

Register for SnackDown 2021: https://bit.ly/3tvjpfB
The video editorial for the 2nd problem (TEMPLEA) of the SnackDown Practice Contest for beginners is out: https://www.youtube.com/watch?v=9UKQu1V2wKM. Check out the detailed explanation of the problem by our expert educators, improve your skills and logic and master the art of Competitive Programming.

The first Starters of September is here: https://bit.ly/3hbKvUi! Rated only for Division 3 coders, the contest will go live on Wednesday, 15th September at 8 PM IST. So start your preparation now and give this your best shot.

Another episode of Weekends With Champions is on its way: https://bit.ly/3ha1hCV, and this time we are talking to Nishant Chitkara, two times ICPC regionalist. Join us on September 11th and get to know how he cracked the competition!

🔴You can checkout the complete DSA For Placements -Learn the Basics, course in Bilingual, Click on the playlist link - https://bit.ly/3kflAjf

Network with the people who will help you grow. With access to industry specialists and top IT professionals, you can grow at an even faster pace: https://bit.ly/3trAhDP! Learn the A to Z on how to ace your technical interviews, get your projects reviewed by experts, understand how you can increase your CP ratings, build your technical competency, and much more for just Rs 83 per month for a one-year subscription. Use code CODECHEF for an extra discount.

Let f(n, B) be the sum of digits of the integer n when written in base B.
Given Q queries, each consisting of three integers n, L, R, find B such that f(n, B) is minimum for all L <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/3l3oCYl

Tune in at 8 PM today for the next episode of 'DSA for Placements': https://bit.ly/3E2gK1Z, where Mohammad Fraz will discuss some practice problems on Dynamic Programming.

Starters 11 will be here on 15th September, 8 PM IST onwards: https://bit.ly/2X1fv2s. So div 3 coders, make sure to participate and show off your coding skills.

This is your chance to participate in SnackDown 2021: https://bit.ly/3yXLgpN and make your college proud. Register right away, and start your preparation!

What if we told you, you can have access to exclusive content by top educators to help you ace all your interviews for just Rs 83 per month for a one-year subscription: https://bit.ly/3l6JqxX? Get expert help for your projects, improve your technical competency and CP skills, and much more! Use code: CODECHEF for an extra discount.