Chef has A units of solid and B units of liquid. He combines them to create a mixture. What kind of mixture does Chef produce: a solution, a solid, or a liquid?
A mixture is called a:
1) A solution if A > 0 and B > 0,
2) A solid if B = 0, or
3) A liquid if A = 0
Solve the problem: https://bit.ly/2YbaLb7

👉You can Learn the complete ''Master DSA - Advanced level'' in 16 hrs. Click on the playlist link - https://bit.ly/3yTYEvg

Chef has 3 boxes of sizes A, B, and C respectively. He puts the boxes in bags of size D (A <= B <= C <= D). Find the minimum number of bags the Chef needs so that he can put each box in a bag. A bag can contain more than one box if the sum of the sizes of boxes in the bag does not exceed the size of the bag.
https://bit.ly/3FdAXCn

Anyone who wants to step into the world of programming, but is not sure how to - this AMA session is for them: https://bit.ly/2YdKjgA. Chitrank Mishra, SDE at Dentira, is joining us today to answer all your questions. Spread the word among your aspiring programmer buddies & tune in at 3 PM.

With 41k+ registrations from around the world, SnackDown 2021 is going to be bigger & better than ever: https://bit.ly/3oqAA1h. The qualifier round will begin in 12 days. So register now, compete with the best & stand a chance to win exciting prizes.

If you felt stuck while solving any of the practice problems, here are all the solutions to help you out. Ten more video explanations are out now: https://bit.ly/3A6Innk, and it is time for you to learn new concepts and techniques to solve each of them.

To all the movie buffs out there, you definitely would have been mind-blown after watching Avatar, right? Or about how they made Gravity seem so real? Check out the blog to know more about how the programming behind the software that made this happen.

Read more: https://bit.ly/3A0dMYw

You are given an integer N. Consider the sequence containing the integers 1, 2, ..., N in increasing order (each exactly once). Find the length of the longest subarray in this sequence such that the bitwise AND of all elements in the subarray is positive: https://bit.ly/39YWqAK.

Are you practicing the beginner-level problems? More video solutions are out today: https://bit.ly/2WAX2cy. Check them out, and work on your concepts & skills.

This is your chance to participate in SnackDown 2021 and make India proud. Register right away: https://bit.ly/3uAd7vO and start your preparation, because the qualifiers are just 11 days away!

If you are confused about what to refer to while learning important algorithms, fret not. You can get answers to all your questions from our experts, build your technical skills, get your projects reviewed, and much more for just Rs 83 per month for a one-year subscription: https://bit.ly/3B4tKlH. Use coupon code: CODECHEF

42k+ coders have already registered for SnackDown 2021! If you haven’t, then this is your chance to register and begin your preparation right away.

Register Now: https://bit.ly/3a8Okpf

👉You can watch the complete Master Stacks series Click on the playlist link - https://bit.ly/3F62RQK

The MEX(minimum excluded) of an array is the smallest non-negative integer that does not belong to the array.
Find the maximum possible MEX of an array of non-negative integers such that the bitwise OR of the elements in the array does not exceed X: https://bit.ly/3FgOLvW.

Do like 👍 and share the session
https://youtu.be/YxsXbhjR0pk