We’re done with Code Senso, and now is the time for you to delve into the video editorials and learn how to solve the questions you couldn’t do: https://bit.ly/2Ye3QxN.

It’s the time of the year when we celebrate with our loved ones, light diyas, and eat sweets till our tummies are full. Yes, it’s Diwali! Happy Diwali to y’all! May all of you have an exciting and prosperous year and life, let the light prevail, and the good win over evil.

One more day, and it’s the Long Challenge: https://bit.ly/31uOupS! Starting tomorrow at 3 PM IST, the 10-day contest is rated only for Division 3 coders.

Mohammad Fraz is joining us tonight at 10:30 PM to discuss and teach you all about Factorial Knapsack in Greedy Techniques: https://bit.ly/3CK9dDX.

October's Starters were definitely surreal, with many coders unleashing the fierce coder in them. Check out the blog to know about the colleges that debuted at the top in these contests: https://bit.ly/3CL6iLh.

Who doesn’t love an upgraded and new version of things?! We gave a small makeover to our goodies store, and also included the much-requested CodeChef Bags in the merch. Head over right now and check them all out: https://bit.ly/3bInXqN.

The day is finally here! Be all set to participate in the 10-day November Long Challenge starting today at 3 PM: https://bit.ly/3bITuJk.

In today's session of Bit Manipulation Algorithms, we will up the level a bit and solve medium difficulty level questions with Chitrank Mishra: https://www.youtube.com/watch?v=LHZ6EfwTHX0&list=PLQXZIFwMtjoxar94yw5e6p-sVm1M-bbcP&index=4. So make sure to grab a notepad, and join us at sharp 7 PM.

Tonight, Mohammad Fraz will be joining us to explain & solve problems on the Job Scheduling algorithm: https://bit.ly/3GSKmAb. So make sure to tune in at 10:30 sharp, and catch everything that you need to.

October has passed, and winter is almost here. This time we saw lots of young school coders give tough competition to experienced pros. Check out the blog to know more!
https://bit.ly/3o2zGpT

The current price of petrol is X rupees and it increases by A rupees at the start of every month. And the current price of diesel is Y rupees and it increases by B rupees at the start of every month. The Chef is curious to know which fuel costs less at the end of K-th month.
Solve the problem: https://bit.ly/3bNKToC

Where were you when we went on a one-on-one conversation with Swiggy CTO, Dale Vaz? Keep yourself inspired by listening to the programming journeys of the tech legends of new India. Conversations With CodeChef brings you the programming pep-talk you always wanted.
https://bit.ly/3ERWHTn

Chef has X coins with the denomination of 1 rupee and Y coins with the denomination of 2 rupees. He wants to distribute these coins among his two sons so that each son has coins with equal price-value. Find if Chef will be able to do so.
Solve the problem: https://bit.ly/3008D6W

Here are a few of the best practice problems for you to work on and test your skills on Greedy Algorithms: https://bit.ly/3BRzKOc. Join us at 2 PM today, to solve these problems with Mohammad Fraz.

A community is what you need to share and learn new skills, develop your leadership skills, and endure on your Competitive Programming journey. Check out what Shubham from CodeChef SNU Chapter has to share with you regarding how much this has helped him.
Applications close soon! Head over to the link right away: https://bit.ly/CodeChef-Initial.

Chief Technology Officer of Big Basket shared his story & how he made it to the top, with us! Check out the video to see and learn from him: https://bit.ly/3qbHuIM.

Naveej speaks some weird language whose alphabet contains n characters. He has an array A where A_i denotes the number of occurrences of the i-th character he has.
He wants to make a palindromic string using all the characters he has. And to achieve that he can perform the following operation:
Select i (1≤i≤n) and convert all the occurrences of i-th character to any other character.
Help Naveej find the minimum number of operations that he has to perform that will allow him to create a palindrome from the characters he has: https://bit.ly/3GVZgWx.

We had a very special guest in Conversations with CodeChef. CTO of Rippling, Mr. Prasanna Sankar shared his stories, tips, and much more that helped him. Check out the episode right away!
https://bit.ly/3CUsLVX

ICC Men's T-20 partner & global FinTech infrastructure company, Nium, has a coding challenge with fab prizes just for you: https://bit.ly/3wqL4zE! Nium is also on the lookout for a lot of coders with 2+ years of experience from across the globe! With fabulous prizes and a chance to work remotely, Code Nium Challenge is for you!! Registration for the contest and application for SE/SSE roles are now open!
PS: The contest is open for all. However, coders with 2+ years of experience will be eligible for the prizes & job offers.

A sequence A_1, A_2 ... A_N of length N is called good if it is either strictly increasing or strictly decreasing or there exists some i (1 < i < N) such that the sequence increases strictly from A_1 till A_i and decreases strictly from A_i till A_N.
We are given an array A consisting of N integers. and we have to find a good sequence by rearranging the elements of array A or report that this is impossible. And if there are multiple such good sequences, print the lexicographically largest one.
Solve the problem: https://bit.ly/3wu7Nen