Solving Google Code Jam Qualification Round 2020 A-D 

How long do you practice per day?

@@aamnasayyed Between college and home chores like 3 hours a day

Same here! I solved 2 (almost there with 3rd).

@@S4ND1X Great! How long did you continue this routine?

@@S4ND1X can a boy of 16 yrs old learn this?

What is the very meaning of keeping a qualifying marks of 30 marks ? if we are allowed to see online solutions of this contest ? This is against the spirit of Competitive programming merely for likes and subscribers you should not be doing this ! I didn't expect it from you !

The qualification round was intended for Google to give beginners a chance to learn, that's why Google made it 24 hours, and it was never intended to be a serious contest. There are future rounds in Code Jam which will ensure the competitiveness of the contest. I just wanted to help beginners (perhaps this is their first ever round) who are really trying hard to qualify.

@@kartikbhatia4940 Qualification Rounds are basically to promote competitive programming I guess, so its fine to discuss. Else, the rules would have stated that you are not allowed to discuss, and maybe would have organised a qualifier of 2.5 hours to 3 hours.

@@tmwilliamlin168 Codechef Long challenges also last more than 24 hours but even discussion for them is prohibited it is sad to know that Google allowed discussions during the contest itself ! No hard feelings with you but just amused about How The qualifier round is not a serious one :( ! Looking forward to more of your videos and your nice explanations ! :) Happy Coding !

I know it might be sad for some people who tried these problems, but isn't it better to get more people involved in CP? Imagine a beginner who realizes that he can't even solve the second question and just forgets about CP entirely before the round even ends, versus if he had seen the solution earlier and thought "Actually, this doesn't seem that hard. With more practice, I can definitely become better at this!".

I legit thought I was the only one 😂😂😂

i learned some programming on a very basic level but idk what the F hes doing 🤣 it's just good to listen to, like an asmr :D

Same

@@tamasfeka5026 facts

Yes please!

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-89SNg8V-ifM.html I think this video might help

Or maybe after inserting elements into set check if s.size()!= n then count++

When sort with end time that means u want to join as much activities as possible because the earlier it finish the earlier u can join the other activities. But this question is about overlapping, so the earlier it starts the smaller the risk that will overlap.

This is kind of the tutorial... I explain my solutions as I solve the problems

@@tmwilliamlin168 Can you please provide why the greedy approach works for the third problem or any resource would be fine! Thanks

Dont fall into the Tutorial Trap.Go the Hard WAY

@@praharshsingh2095 You mean using bipartite concept ?

@@subhajitmanna305 Haha Good One :P

ioi??

@@secularph8424 international Olympiad of informatics (foe high school students only)

@@vivekmishra4994 ok

Hopefully I can finish that video within the next 12 hours

William Lin Which editor do you use ?

study student vim

ok pritishn

@@AyushGupta-mm4jg lol, i should have changed my profile pic 😂

See the description, I quote the rule which says people can discuss during the qualification round.

Discuss, not to copy the code..

Google states it as "sharing information", which includes sharing ideas and code.

You're the best jugde for that I just didn't wanted you to get banned. Btw am so in love with this series of yours it is really helpful. Please share something about your journey as well.

@@tmwilliamlin168 Bro how did u customize ur tabs to glow green like that. And can u do a setup video

You can do it by sorting on ending times. The issue most people had was that when both J and C were available, they were assigned jobs in a fixed manner irrespective of who gets free first.

Yes, I fixed that during the debugging session but I forgot to mention that in the video

same went for me, got 7 wrong attempts. even I was trying to figure out. Let me know if you find out anything.

@@subhajitmanna305 discuss.codechef.com/t/google-code-jam-2020-problem-3/60303/12

or check out with this test case 1 5 1 4 0 200 50 100 150 300 250 270

@@Amit_Kumar_1999 Thanks here! But I am not to figure out how to proof this greedy approach works here.

@@subhajitmanna305 Proof is the tricky part of greedy solution. As i earlier mentioned that i felt this is related to Exchange Arguments. So i think just check out these. You might get something . Also if you found something mention here or mail me offamitkumar[at]gmail[dot]com

After watching ur vid, I realize the way I approach Q4 is totally all wrong 😅

See the description, I quote the rule which says people can discuss during the qualification round.

@@tmwilliamlin168 I believe that discussion and showing solution code is different. But anyways I'll watch it tomorrow ❤️, thanks

It's not limited to discussing, Google describes it as "sharing information", which includes all of discussing and showing solution code.

See the description, I quote the rule which says people can discuss during the qualification round.

@@tmwilliamlin168 Great! But the link is broken. You added a ':' at the end.

Thanks for letting me know!

Sorry i didn't watch till end that time. Now i know why E is missing.

My understanding of recursion is that a function calls itself, until it reaches its base case. for example , if you're trying to find the factorial of an integer you can do: public int factorial(int n){ if(n==1) return 1; // this is the base case, once the function reaches this case it returns 1; // the factorial of 1 is just 1. // if your function does not have a base case the function will loop infinitely until your machine runs out of memory. else return n*factorial(n-1); /*this is the recursive case, the function calls itself until it reaches the base case. For example if n=3, then the factorial of 3 = 3 * factorial(2), the function then needs to find the factorial of 2. What that is is just 2 * factorial(1). and the program knows that the factorial of 1 is just 1. So it multiplies 2*1 and returns it to the function calling it. So now the original function we called has an equation that looks like this --> 3* 2 and this equals to 6 so the factorial of 3 is 6. }

hope my explanation helped.

Where do you practice

See the description, I quote the rule which says people can discuss during the qualification round.

@@tmwilliamlin168 Bro I don't think that's fair because this way everyone will qualify the round. It'd be better if you remove this now and upload it tomorrow.

See the description, I quote the rule which says people can discuss during the qualification round.

@@tmwilliamlin168 Still u should have not uploaded it, i lost motivation to solve question further because now people will just copy paste the code

Yea, I understand that there are drawbacks, but the purpose of this round is to give beginners a chance to get involved with these competitions and not for actual competition. If the competitiveness is your motivation, then you will have that motivation in future rounds.