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

October is done, and here's a tally of all the highest performing new colleges who made their mark in Lunchtime and Cook-Off last month. Shri Vishnu Engineering College For Women, Bhimavaram, shone in the limelight this time with a whopping 1k+ submission. We also saw VNR Vignana Jyothi Institute of Engineering and Technology, Madan Mohan Malaviya University of Technology Gorakhpur, Dr. BR Ambedkar National Institute of Technology, and NIT, Durgapur dominate and leave their mark this time. Check out the blog to know more about them!
https://bit.ly/3H6iKaY

Kunal Verma, Software Engineer at Google and ICPC’20 World Finalist, is joining us this Saturday at 3 PM to discuss and share things that helped him out in the long run. Hear him out and submit your question today!
https://bit.ly/3BXXobZ

Do you have 2+ years of experience and looking for a change? Global FinTech Infra company Nium has come up with a fabulous coding challenge to hire for SE/SSE roles. With a chance to work remotely, Code:Nium Challenge is all 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.
https://bit.ly/3bWB5cc

Chef wants to find any connected undirected graph with n vertices and m edges with the maximum number of bridges. The graph should not contain any self-loops or multiple edges. Please help him with this task.
https://bit.ly/3wuDt3j

How to prepare for prestigious competitions? How to crack tech interviews and land the dream job? Get all these queries answered in our upcoming episode of Weekends With Champions this November 13th, featuring ICPC’20 Finalist & Google SDE, Kunal Verma.
Register Now: https://bit.ly/3BYbASi

Get, set, and start coding! If you have 2 years+ experience, then Code: Nium is the challenge for you: https://bit.ly/3qv8gMx! The registration window is already open, and the contest starts on 15th November 2021. The top performers will get a chance to work with ICC Men's T-20 Partner & Global FinTech Infrastructure company Nium for SE/SSE roles, and bag prizes such as MacBook Pro, iPad Pro & Swag Goodies! So register right away.
PS: The contest is open for all. However, coders with 2+ years of experience will be eligible for the prizes & job offers.

A software engineer at Google, an ICPC World Finalist, and a die-hard competitive programming enthusiast, Kunal Verma will share coding tips, preparation methods, and his mantra for success this Saturday, 3 PM on Weekends With Champions. Send your questions in the form to make sure we pick them first: https://bit.ly/3BYbASi! Spread the word.

Cricket has forever been one of the most loved games. WT20 is going on, New Zealand has already marked their place in the Finals, and now we are eagerly waiting for the new champions. But did you know that programming is used even in Cricket?! Check out the blog to know more.
https://bit.ly/3okoQvz

Chef has an array A of N non-negative integers, where N is odd. Help him find the minimum non-negative integer x that satisfies the equation (A_1 + x) ⊕ (A_2 + x) ⊕ ... ⊕ (A_N + x) = 0 where ⊕ denotes the bitwise xor operation.
https://bit.ly/3kpKAFg

It's raining contests this month, and here's the first Starters of November: https://bit.ly/3qqtjjd. Starters 17 will be on 17th Nov, 8 PM IST onwards. And this time, it's rated for both Division 2 and 3 coders! So make sure to participate and show off your coding skills.

Code: Nium is the challenge for you if you have 2+ years of experience: https://bit.ly/3odHqWk. Participate in this coding contest, win big prizes such as MacBook Pro, iPad Pro, and lots of other goodies. The top coders in this challenge also stand a chance to work with this global FinTech Infra company. So register right away, and start your preparation.
PS: The contest is open for all. However, coders with 2+ years of experience will be eligible for the prizes & job offers.

Kunal Verma, ICPC finalist and SDE 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. Send your questions in the form below to make sure we pick them first!
https://bit.ly/3BYbASi

We call a string S valid if either S = ? or S = (x + y) or S = (x - y) where x and y are valid strings. The power of a valid string S is defined as the maximum value that can be attained by replacing each '?' in it either by 0 or 1 and evaluating the resulting expression. Chef is given a valid string S and Q queries on it. For each query, he is given two integers L and R (L <= R) such that the substring S[L...R] is valid. Help Chef in finding the power of this valid substring for all queries.
https://bit.ly/3c75bcR