In this week's Coding With Champion series, Tanuj Khattar, a two-time ICPC Finalist, is joining us to discuss Square Root Decomposition on Trees. You will learn how to apply the Square Root Decomposition technique to solve challenging problems. Square Root Optimization technique is a query optimization technique used by competitive programmers to reduce the time complexity by a factor of sqrt(n). Using this method, you can perform some common operations such as finding the sum of elements in an array, the minimal or maximal component in an array, and so on. He will explain the pre-requisites and the theory and applications of Square Root Decomposition so that you can easily follow the session tomorrow.

Starting in an hour

Now that the interview season is here, get answers to all your questions from Ritika Nevatia, SDE at Apple. Tune in at 7 sharp tomorrow.
Register & ask your questions to Ritika now itself: https://bit.ly/3xhTxnX

Day 1 of ‘DSA Simplified For Fast & Effective Learning’ is done, and it was a jam-packed session, right?! Join us for day 2 at 12 PM tomorrow. Check out the itinerary to know what we have in store for you.
Join Here: https://bit.ly/2TLkIJT
Use access code: CODECHEF

Yesterday’s Coding With Champions was an exhilarating yet informative session, right? Join us for part 2 of the session today and learn how to approach and solve the Square Root Decomposition problem.
https://bit.ly/3fhweUW

Hope you are all ready with your questions! Ritika Nevatia, SDE at Apple, is joining us today at 7 PM to share her success mantra & tips and answer all your questions.
Join Here: https://bit.ly/37cUJOM

The video editorials of July Lunchtime are here. Watch all of them, and learn from the top coders themselves.
https://bit.ly/2VnEueO

Ritika is answering some really interesting questions for you. Do join to know the answers and ask follow-up questions

Announcing the first contest of the month, the August Long Challenge. The 10-day competition gives one enough time to efficiently tackle a problem by reading the concepts, and also gain practical experience by coding the solution to the problem. Participate from August 6th, 3 PM IST and improve your skills.
PS: This month's Long Challenge will be rated only for Div 3.
Set a Reminder: https://bit.ly/3yiQ6i7

Announcing the revamped editions of our favorite batches. Eklavya 4.0, an 8-month complete course on programming for beginners: https://bit.ly/3zZZs2r. For all the advanced coders looking to improve their skills, we have MahaYoddha 3.0, a 2-month master course on all the advanced programming topics: https://bit.ly/3ihkwvq.
Use coupon code: CODECHEF

We all express our views on Twitter, but ever wondered how to get into the company? Well, then this is your chance to know that from a Twitter Engineer himself! In this week's Tech Interview Secrets, Apurva Patkeshwar will join us to discuss and answer all your queries.
Register & ask your questions to Apurva now itself: https://bit.ly/3jd9h6s

The August Long Challenge is almost here! Participate in this 10-day long contest with coders from over 180 countries and learn new concepts and skills!
Set a Reminder: https://bit.ly/2TOl0zF
PS: This month's long challenge is rated only for div 3.

In this video of the Frequently Asked Interview Problem series, Saptarshi Mukherjee, incoming SDE at Google, solves the very challenging problem - 'Unique Combination For a Given Sum'. Given an array of size N, you have to find all the unique combinations such that the sum of the elements is equal to a given integer K.
Check out the video where Saptarshi discusses how to approach the question and how to implement the concepts.
https://bit.ly/2VoqCRG

Announcing ‘Programmer’s Carnival 2.0’, a two-day weekend series on DSA, System Design & Full Stack Development. With topics from DP to Microservice Architecture, this specialized camp is the perfect place for anyone to learn these subjects with expert proficiency.
Block your calendars on 7th - 8th August, 12 PM onwards.
Register Now: https://bit.ly/3lpNET2

In the 2nd session of DSA for Placements, Mohammad Fraz will discuss Searching and Sorting and its applications. We will learn how to use different search algorithms such as linear or binary search to find a particular element in the list.
Join here at 8 PM today: https://bit.ly/3Ae329z

Laddus and goodies are extra icing on top for you to participate in this month’s Long Challenge. The contest starts on August 6th, 3 PM IST and is rated only for Division 3 coders.
Set a Reminder: https://bit.ly/3xifinz

Problem #1 of the Ada August-a Challenge is out.
https://bit.ly/3xl6L33
One of the easiest problems under our FLOW series: FLOW010
No hint is required, so we are not sharing any. Try solving it yourself, or you can take help too.
If this is your first attempt on CP, then try solving the FLOW001 problem instead, as it has a blog explanation that you can make use of: https://bit.ly/3rSzN93. Once done, then come back for the first problem of Ada August-a Challenge, and let's get started together.

One more day, and it’s the Long Challenge! Starting tomorrow at 3 PM IST, the contest is rated only for Division 3 coders.
Set a Reminder: https://bit.ly/3lv5Af4