The 2nd class of Aspire 2.0 starts in 15 minutes. Incoming SDE at Microsoft, Nishant Chahar will discuss in detail the interview preparation for FAANG companies. It will be followed by a QNA session.
Join Here: https://bit.ly/3w6X748
Use access code: CODECHEF

This week's WWC with Udit Sanghi is tomorrow! He will talk about his experience at the IOI, how he bagged a silver medal, and much more. Join us at 3 PM.
Register Now: https://bit.ly/3hNOffy

The 3rd class of Aspire 2.0 starts in 30 minutes. This interactive session is for those beginners and intermediates looking to skill up in number theory. We will build upon the core fundamentals to help you build a solid roadmap to becoming an advanced programmer.
Join Here: https://bit.ly/3wTJOnG
Use access code: CODECHEF

Join Here: https://bit.ly/3poFqKT
Use access code: CODECHEF

We're hiring YouTube Educators! That's right, the Unacademy YouTube team is looking for ardent coders who are passionate about teaching. Grab this rare opportunity to grow as a YouTube star impacting millions of learners out there with your knowledge and voice. Check the JD for more information and apply. Happy Teaching!
Apply Here: https://bit.ly/3ckpEeT
Job Description: https://bit.ly/3ckgjn8

You heard it right, we are going to launch 2 new batches on June 8. Beginners can be career-ready with Adroit 2.0, an extensive 9-month course covering all the essential algorithms, introduction to Competitive Programming, and core DSA topics.
For the advanced coders out there we have a special 1-month batch focussing on Graph Algorithms and Interview problem-solving. Subscribe Now!
Adroit 2.0: https://bit.ly/3wVnASv
Graph Algorithm: https://bit.ly/3z4JuEI
Use coupon code: CODECHEF

The last class of Day 1 of Aspire 2.0 starts in 15 minutes. In this session, Sonia will talk about one of the most important techniques to learn and improve your performance in competitive programming - the art & science of upsolving. Highly recommended for beginner & intermediate level learners.
Join Here: https://bit.ly/34URyd6
Use access code: CODECHEF

Chefland has 2 different types of coconut, type A and type B. Type A contains only x_a milliliters of coconut water and type B contains only x_b grams of coconut pulp. Chef consumes X_a milliliters of coconut water and X_b grams of coconut pulp every week. Find the total number of coconuts (type A + type B) that the Chef should buy each week.
To solve the question, visit: https://bit.ly/3wWHV9W

Yesterday's camp was fun, right! Today is going to be just as great. Go have a sneak peek at the itinerary to know what we have for you today.
Join Here: https://bit.ly/3ijp3xI
Use access code: CODECHEF

Join us at 3 PM today for a 1 hour AMA session with Udit Sanghi. He will answer all your questions & share his experience of winning a medal at the IOI & APIO. Don't miss out!
Join Here: https://bit.ly/34PaRVk

The 2nd session of day 2 of Aspire 2.0 starts in 30 minutes. This class will take you through algorithms based on string as a data structure. We will also discuss some popular algorithms like KMP.
Join Here: https://bit.ly/2TOU16Z
Use access code: CODECHEF

The next episode of WWC with Udit Sanghi is about to begin.
Join Here: https://bit.ly/34PaRVk

In the next class of Aspire 2.0, Sonia Motwani will cover some basic concepts in discrete mathematics and will unravel a whole new section of Competitive Programming.
See you in 10 minutes!
Join Here: https://bit.ly/3vWuYNl
Use access code: CODECHEF

Chef is planning to hijack a bank for D days and print the money. The initial rate of printing the currency is P dollars per day and they increase the production by Q dollars after every interval of d days. For example, after d days the rate is P+Q dollars per day, and after 2d days the rate is P+2Q dollars per day, and so on. Output the amount of money they will be able to print in the given period.
Solve the question here: https://bit.ly/3uTP0qf

The last class of Aspire 2.0 starts in 30 minutes. Google SWE Deepak Gour will discuss some non-trivial advanced data structures and some advanced applications of data structures.
Join Here: https://bit.ly/34Zefgh
Use access code: CODECHEF

Join Here: https://bit.ly/3cm3I2O
Use access code: CODECHEF

It's time to turn a new leaf and make some changes. For the beginners out there we have Adroit 2.0, a 9-month course covering the core DSA topics, introduction to Competitive Programming, and algorithms: https://bit.ly/34SpOGd
The second batch is for advanced-level coders to make them more strong in algorithms. This is a one-month course covering Graph Algorithms and Interview Problem-Solving: https://bit.ly/3fSBnDI
Get access to both courses with the same subscription. Use coupon code 'CODECHEF'.

We got loads of learning done the last week at Learn Competitive Programming With CodeChef, and in case you missed out on the live classes, we're here with a recap to bring you up to speed!
Read the blog here: https://bit.ly/3ijYcll

Set a Reminder: https://bit.ly/2S5LiNd
Use access code: CODECHEF

There are N cities in Chefland numbered from 1 to N and every city has a railway station. Some cities have a train and each city has at most one train originating from it which either goes left or right. Each train keeps on going forever in its direction and takes 1 minute to travel from the current station to the next one. There is a special station at city 1 which lets travelers instantaneously teleport to any other station that currently has a train. There are M travelers at city 1, and the ith traveler has destination city B_i. Find the minimum time required by each traveler to reach his destination.
Solve the question here: https://bit.ly/2SY344V