If this question racks your brain, then you sure should participate in the 3rd test of Elevate 2.0. Attempt the 1-hour MCQ-based aptitude test on Saturday and stand a chance to win exciting scholarships to the Learn Competitive Programming subscription!
Enroll Now: https://bit.ly/3lX1g8I
Use access code: CODECHEF

You are given a convex polygon with N sides. You have to answer Q queries. The i^{th} query is described by two integers v_i, t_i. In this query, all sides of the polygon start moving parallel to their respective perpendicular vector away from the centroid with a constant velocity of v_i units per sec. Output the final area covered by N sides of the polygon after time t_i seconds.
For each query, consider the initial coordinates of vertices of the given polygon.
Solve the problem: https://bit.ly/3m2Fkci

Here’s the next video in the ICPC Preparation Series. Today we will have a look at two crucial topics, Divide and Conquer and Binary Search algorithm.
Watch here: https://youtu.be/S1_Vfg3XAv0

In this week's Frequently Asked Interview Problem series, Saptarshi Mukherjee, incoming SDE at Google, will be solving the Trapping Rainwater problem. This is one of the critical and challenging problems asked by many top-notch companies.
Problem Statement: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
Join us at 6 PM today as he discusses how to approach the question, what are the concepts, and how to implement them in the given question.
https://bit.ly/3yKDa4K

Announcing something new! How about Live Shows that are precisely about your career? Watch our experts as they speak with Technical Recruiters about current hiring trends and IT professionals who have won against odds to start successful careers. Catch them to discuss college projects, hiring updates from companies, how to improve your CP star ratings, and everything that you could ask for. A segment that contains highly-researched content and findings. Subscribe Now to watch all these exclusive shows for just Rs 999 per year.

Subscribe here: https://bit.ly/3m2mzWu

Use Code - CODECHEF for your discount.

There are N people in a train and each of them gets on the train at time t = 0.
Each person on the train wants to use the charging station on the train for some amount of time, but unfortunately, the train has only one charging station and can only be used by 1 person at any point in time.
The i^{th} person wants to use the charging station for A_i minutes in total and will leave the train at time T_i.
A person will be satisfied after the journey, only if that person gets to use the charging station for the desired amount of time.
Find a way to schedule the charging such that a maximum number of people is satisfied.
Solve the problem: https://bit.ly/3g1Kguh

Tamajit Banerjee, six-star coder & upcoming SDE Intern at Google, will be joining us tomorrow to clear all your doubts, share his tips and methods, and much more. Make sure to tune in at 3 PM tomorrow.
Register Now and ask your question to Tamajit: https://bit.ly/37xYBdb

Who wouldn’t love a Ted talk, that too every week! In today’s Live shows, well-acclaimed IT professionals will mentor learners, talk about a few of the most important questions asked in interviews, will give tips from their real-life experience to increase CP ratings, and much more. And for some essential tech extracurriculars for programmers like you, we have another Live show on Digital Marketing. And the best part is, you get access to this exclusive highly-researched content just for Rs 999 per year! Use code CODECHEF to avail further discount.
Subscribe Now: https://bit.ly/2VUZXfV

The contest is heating up, and the Chef is back again with another challenging question for you. Head over to the website and solve Problem #6 (MAX2) of the Ada August-a Challenge.
Compete Now: https://bit.ly/3sgX2d4

The second edition of #AnybodyCanCode is here! If you are a newbie in the vast world of programming, then you can start your coding journey with CodeChef. We will be discussing the absolute basics of programming and then move ahead to write the code. Make sure to tune in at 3 PM sharp, 16th - 20th August, and embark on this coding journey with us.
Register Now: https://bit.ly/3AK9YLT

The first Starters of August is here! Rated only for Division 3 coders, the contest will go live tomorrow, 15th August at 8 PM IST. Do some last-minute revision now and give this your best shot.
Set a Reminder: https://bit.ly/2XsvIxn

From the invention of zero to reaching Mars, we all stood together through thick and thin, and our country is celebrating 75 years of independence today. Let's all take a moment to embrace India's very vast cultural and linguistic diversity, all the fights that we went through for our freedom, and say with extra pride that, "Yes, I am an Indian!". Wishing you all a Happy Independence Day and stay safe y'all!

Had a good sleep yesterday? It’s the weekend, and we have two Starters back to back for you! The 8th edition of the contest will start at 8 PM today, and the 9th edition at 8 PM on Tuesday, 17th August. Participate in both, and top the tables.
Compete Here: https://bit.ly/2VY6Ts8

A real talk with experienced people is far better than what you learn in the textbooks, right? For all the tech enthusiasts out there, we have a panel of acclaimed experts joining us to talk about Digital Marketing, Data Analytics, and much more. Learn from the best about how to increase your ratings. You get all this for just Rs 999 per year! Don't forget to use the code CODECHEF for a discount.
Subscribe Now: https://bit.ly/3siqTC4

Weekends With Champions with Tamajit Banerjee has started.
Join Now: https://www.youtube.com/watch?v=dBxbTg4w_hM

Tamajit is sharing his experience from the ICPC regionals held yesterday. Some noteworthy tips for preparation. Do join!

Attention! Something is brewing in our kitchen and will be out soon. Stay tuned....

There are N breakfasts in the restaurant. The i^{th} breakfast has an attractiveness A_i and cost C_i.
The Chef has noticed that nobody takes the j^{th} breakfast if there exists at least one breakfast i such that A_i >= A_j and C_i < C_j.
Find the minimum number of breakfasts whose attractiveness has to be changed by some real number such that the final attractiveness of the i^{th} breakfast lies in the interval [L_i, R_i] so that Chef can have all the breakfasts.
Compete Now: https://bit.ly/3xUqBTi