Google Code Jam Round 1A 2020 Explanations

[@iitnakanpur..]

You are getting popular man, your kickstart video is going to hit 1M views , can you imagine 😲😲😲

[@kunal_chand]

All he needs is a good thumbnail to attract people to his channel

[@mamtachahal1277]

I have been following channel so much lately, after every contest I open your channel and wait for your explanations

[@justthebeast20]

wait am I the only one to just look at this video and be like: how tf did you think about that? xd

[@subhanshareef939]

NO

[@haziqamzar4676]

I watch most of your videos and it is really interesting. I feel motivated to get into competitive scene. Hello from Malaysia!

[@ahmedalzayady364]

your solution of second problem is so great, thanks for that .

[@ANANDKUMAR-jk9yp]

Thank you for this wonderful explanation. I was unable to implement the idea in first question.

[@vishalshrivastava6570]

Your solution for 2 was so good

[@moazeldefrawy4379]

yeah

[@edwardlaurencemolina9372]

Can you make a video about your Vim setup for c++

[@sahilsharma2952]

I was able to think solution 2 on my own. Feels good.

[@DemondKing]

That's cool, how did you learn cp and programming?

[@sahilsharma2952]

@@DemondKing I just like it so I keep on solving problems and read editorials. You just get the intuition along the way. I am just a beginner tho.

[@DemondKing]

@@sahilsharma2952 Can you tell me resources that you used?

[@sahilsharma2952]

@@DemondKing Participate in as many contests as you can. Read their editorials and read the new topics that you find. Alternatively if you wanna read all algos and DS first, try cp-algorithms.com and a2oj ladder problems for practice.

[@varunrajesh1715]

Thanks for the solid explanations especially for B! Will you be taking part in the next 2 rounds as well?

[@shubhamk840]

I think soon we will study a new algorithm , called William Lin algorithm.

[@Crossbyy120]

I'm a law student, but I'm fascinated by programming watching your videos. Congratulations my friend :)

[@prateeksinghal630]

Please upload codeforces rounds videos explanations as well !!

[@parekshamanchanda8083]

The last question is very well explained. Thanks!

[@manjunathvasam4981]

Gennady is here!!!!!

[@Your_paps]

Very well explained my good sir

[@x0cx102]

Aw man, I got to the final step of problem 2, but didn't realize that it would overshoot by at most 30, so I left the idea and didn't implement it :(

[@thakararkeval4759]

your videos are great and one request can you increase your volume it's very low

[@Learner010]

when you add k on left hand side then why not you balance it by adding k on right hand side on the explanation of problem 2?

[@paramgoswami7224]

You dont know the k value so it will be hard to find the binary expression of n-30-k

[@tmwilliamlin168]

It's not the same equation

[@yogeshpandey009]

It is tricky to explain, basically 30 already includes 1s in k rows so he subtracts 1 for each k rows. n = 30 + (2^r_1 - 1 + 2^r_2 - 1 ..... + 2^r_k - 1) + k

[@AIPlayerrrr]

suggestion: plz briefly review the problem

[@ankur2443]

Thank you for the explanation

[@LeandroCoutinho]

what do you use Eclipse for? Debugging C++?

[@williamwambua7710]

HAHAHAHAHA!!!! funny how my name is also William and we taking the same major....Computer science. Ima sub!!!!!

[@okoks9011]

Thank you for your nice explanation!

[@UnwrapTheExperience]

Can you please explain? .In the last question, why are you deleting the i,j because once you insert it and calculate all it's neighbor possible cases then it should get ignored as it is in tr2 and you have cleared tr1

[@jeetganatra7977]

Keep up the great work William!! Did you take part? Didn't see you on the leaderboad

[@tmwilliamlin168]

overslept :P

[@robert1292]

​@@tmwilliamlin168 me too, sleeping is the best thing.

[@vivekmishra4994]

Hey can you provide solutions with explanation for codechef division 2 and codeforces div 3 challenges for beginners like me.

[@hieudoan7711]

Your video 's volumn is so low

[@terroone1018]

What in the ricegum’s little brother is going on here ?

[@ankitkumarsingh2441]

Why did you not participate today?

[@nehalmahida84]

Hey, I missed round 1A can I able to attend Round 1B?

[@justthebeast20]

yes

[@JohnCena963852]

It would take forever for me to solve this.

[@ANANDKUMAR-jk9yp]

But, what if a string contains no asterisk!

[@prajwal9544]

Every string will contain asterisk. Read each test case constraints

[@SlamMur]

If answer doesn't contain asterisk - you simply need to check if this string is answer or not.

[@poojakandoi8113]

Thank you.

[@jack041286]

Thanks

[@NPChen-zn8fy]

這頻道在幹嘛有人能解釋一下嗎

[@maryllcastelino]

How old are you?

[@mohammedshoaib1635]

Maryll Castelino He’s only 17.

[@maryllcastelino]

@@mohammedshoaib1635 Damn

[@tmwilliamlin168]

I'm 18 now

[@harendrasingh_22]

2:06 ohh.

[@RishabhSharma10225]

Thanks for the explanations. Also, it's asterisk, not asterik.

[@anirudhtv]

which language would you suggest for CP

[@adilmathakiya2531]

Mostly people use c++

[@anirudhtv]

@@adilmathakiya2531 but isnt it lengthy

[@anirudhtv]

@Gareth Ma yeah thats a nice way to do so

[@iitnakanpur..]

@@anirudhtv c++ is fast among all the languages and have a great stl collection which makes this language the best

[@safemode5347]

bro do you have telegram account?

[@yashkumar8472]

So u are human ...hmmm.

[@moazeldefrawy4379]

LMAO

[@alston9900]

I think the only thing I know here is English

[@arinroday302]

Please increase your voice

[@nitishpratapyadav1903]

Bro how to become a programmer like you?