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

If your next task in your checklist is to prepare for coding interviews, you are right on time! This weekend's 2-day learning event, Programmer's Carnival 2.0, will help you ace all the upcoming interviews. Register in the link asap! https://bit.ly/3lpNET2

Learn GCD and one most common GCD algorithm - Euclid's GCD algorithm and its applications. Greatest Common Divisor or GCD algorithm is used to compute the GCD of two integers. Euclid's GCD algorithm reduces fractions, RSA crypto, computing the LCM, and much more. https://bit.ly/2Vq9POw

The day is finally here! Make sure to have lunch a bit early, and unleash the coder inside you at 3 PM today.
Compete here: https://bit.ly/37nqVyV
PS: This contest is rated only for Division 3 coders

You are given the difficulty levels of the 4 problems as A_1, A_2, A_3, A_4 respectively. A problem set comprises at least two problems and no two problems in a problem set should have the same difficulty level. A problem can belong to at most one problem set. Output the maximum number of problem sets you can create using the 4 problems.
Solve the problem: https://bit.ly/3AjCV0W

If you need answers to endless questions in your mind, then we have the right person for you. Apurva Patkeshwar, Sr. ML engineer at Twitter, will be joining us tomorrow at 7 PM to answer all your questions and share some tips as well.
Register Now:https://bit.ly/3jd9h6s

Starting next week we have five courses and batches for all! Acme 2.0, a 2-month Full Stack Development master course apt for both beginners and intermediate coders. Combat 3.0, a 4-month course on System Design & Backend Fundamentals to career readiness. Leap 3.0 is a 2-month course on System Design to help you take on the real world. Paramount 3.0, a 9-week batch exclusively for Backend Development. Conquer all your fears with Conquer 3.0 batch, a 4-month course on System Design & Full-stack fundamentals.

Check out the batches here: https://bit.ly/3jxGPwa

Use coupon code: CODECHEF

Let's start preparing for ICPC with CodeChef. The first step will be to have a strong base with your DSA concepts. This video by Siddharth Bansal explains Time and Space complexity analysis, one of the basic concepts that every programmer needs to understand. By doing a complexity analysis of an algorithm, the programmer can understand how the algorithm will use the resources.

Watch now: https://youtu.be/dga_HStGF3Q

Today is the last day of the Carnival, and we will discuss a few of the critical topics! Check out the itinerary to know more about today's agenda.

Join here: https://bit.ly/3AfxtvQ
Use access code: CODECHEF

In Olympics, the countries are ranked by the total number of medals won. You are given six integers G_1, S_1, B_1, and G_2, S_2, B_2, the number of gold, silver and bronze medals won by two different counties respectively. Determine which country is ranked better on the leaderboard.

Solve the problem: https://bit.ly/3AjCV0W

It’s finally time to get answers to all your questions! Apurva Patkeshwar, Sr. ML engineer at Twitter, is joining us tonight at 7 PM to help you prepare for your interviews.
Join here: https://youtu.be/4p6EPIOLzOY

Here is the next video of the ICPC learning series. In this video, Sidhant Bansal is explaining the complexity analysis in detail. The complexity of an algorithm computes the amount of time and spaces required by an algorithm for an input of size (n). By doing a complexity analysis of an algorithm, you can understand how the algorithm will use the resources.

Watch now: https://bit.ly/3jqZ2M0

Chef is trying to invent the light bulb that can run at room temperature without electricity. So he has N gases numbered from 0 to N - 1 that he can use and he doesn't know which one of the N gases will work but we do know it.
For searching, Chef first chooses an integer K and selects all indices i in increasing order such that i mod K = 0 and test the gases on such indices, then all indices i in increasing order such that i mod K = 1, and test the gases on such indices, and so on.
Given N, the index of the gas p that will work, and K, find after how much time will he be able to give Chefland a new invention assuming that testing 1 gas takes 1 day.

Solve the problem: https://bit.ly/3ivAPVD