2nd Place in Google Kickstart 2020 G with keyboard-cam and commentary
Вставка
- Опубліковано 13 чер 2024
- Screencast of Google Kickstart 2020 Round G with commentary on problems and contest strategy. Solving the hardest problem in 5 minutes sometimes isn't enough to win.
Contest link: codingcompetitions.withgoogle...
I'm streaming regularly on Twitch now! Coding interview problems on Thursday, and Competitive Programming on Tuesday & Saturday. / errichto
0:00 - A (statement)
0:33 - strategy
1:16 - A (solution)
3:11 - B
4:49 - submit
5:12 - C
10:35 - C (solution)
15:36 - debugging
16:12 - C (solution)
18:17 - cheering for past Kamil
20:50 - submit
21:22 - D
26:00 - results
28:11 - William Lin
- second YT channel for screencasts and old live-streams: / errichto2
- FB and Twitter: / errichto & / errichto
- Frequently Asked Questions: github.com/Errichto/youtube/w...
This is so interesting that 2 guy who finish at the first place and second place in Google Kickstart is recording him self for UA-cam. Both of you and William Lin is an insane guyy
i love this style of video and ur video quality has gone up so much i appreciate the content!
Thank you :)
Yes... Really helpful .
this was supposed to be an easy problem.. umm .. okay
@@mosesmuchemi7221 lol what
did you expect anything easy when it had "google" in it's name
@@mosesmuchemi7221 Dude! hahaha :D ... Loved ya sarcasm ... but
Errichto is so cool as a coder, don't you think so?
Congrats Errichto, this format is just amazing!
It's hilarious when he says "Kamil from the competition" like he's talking about his alter ego.
WOW! Amazing Editing! I can't even imagine the amount of effort it must have taken you! But you aced it! This is so helpful and extremely well done video. Thank you for all your efforts Errichto! More power to you and your channel man!
Congrats Errichto for 2nd position... whenever I participate in any contest , first come to your videos to look to your solutions and your approach...you have been a motivation for me since beginning of my cp journey...keep uploading these kind of videos...thanks
I love the new contents! It was the first time I seen keyboard-cam in a competitive programming video :D
lovely format, errichto! very concise not wasting time and even explaining while past you approaches the problems, very organised and the ending was the cherry on top xDD
Keep it up!
As someone who is still very new to programming I get so overwhelmed watching you perform these challenges that you make look so easy! Motivating to be quite honest.
Explaining your thought process is the best. Very few coding question UA-camr's actually spend the time explaining how to arrive at the solution and not just handwaving and then writing code.
Errichto is on fire 🔥 He's best Competitive Programmer with Best explanation.. way better than many paid websites 🤭😁
May you exist forever to this world! ♥️
This format of video is pretty good, Thanks @Errichto.
Love this style of screencast+commentary!
Errichto is a better guide than any other.
Good to walk with you through the solution thank you.
Congrats man! I'm still starting for your algo lectures, but am excited for your win
loved this style of eleborating the things and congrats for the second position
This video was so good and your explanations were very clear , please do more videos like this
I don't understand anything I am just intrigued.
😋
Same
Same... these people are just awesome. Im barely surviving leet
Congratulations Errichto for 2nd Place!! and Thanks for the Editorials..
This was my first contest. I got the 2813 rank. I was waiting for the solution. I applied the brute force approach and then optimize it. Thanks!
Your solution to last problem is soo amazing!
Me during contest: Thinking 2h 25min about C and getting 3 WA.
Errichto: Didn't think more than 5 seconds.
It's mean you solved A and B in 35 min.
tbh, I spent a lot of time implementing. It was just obvious to me at the very beginning how I can approach this problem because I saw similar problems before. So maybe you're better than me by solving it from scratch.
@@Errichto yes you are right it's just only about solving more problems , then you would became like him ;)
@@Errichto During the contest i tried to ternary search a point P that would minimize the cost, but because of the wrap around (only because of it i think) it didn't work. I think that the key point was to notice that the best point is already present on the input, after having that information i was able to make a O(N log N) solution.
@Cartsanov thats never gonna happen for you bud. Trust me
Errichto is my favorite competitive programmer, even if he got 2nd place, at least he doesn't say "Oh i'm depressed because i've only won 3 out 7 kick starts this year :(". Great spirit from Errichto, beautiful content and great explanation. Thank you for your videos and congratulations for acing the google kick start round G
Ohh are you referring to some William lim.. he's a genius.
Yeah that's just a too Asian thing to say.
My solution for the last problem can be easily improved from O(N^2) to O(N), and it's still just 20 lines of codes. I described it in Codeforces: codeforces.com/blog/entry/83807#comment-711889
Really You're great Man! I don't understand as Like as you do but Still Watching Your contest. I impressed Your Coding Style Your Speed and Also Your Talent
It is great to see you and william compete with each other!!, nice video
errichto this format of facing camera towards keyboard and commenetary with problem solving later is very good because earlier there didn't seemed any point of seeing two faces simultaneously..
Keyboard cam is so rare on youtube. Love it!
Nice to know how your mind works to solve those issues. Nice content.
I started cp a few month ago and these video insights are very helpful for my understanding. Big thanks errichto. Great video as always!
Btw it's a little bit scary how addicting cp is
lol yeah
the satisfaction after getting a accepted solution is addicting
Thank you for the educational content! Really helps newbies like me hahaha. I still dont know how exactly to solve problems C and D but i will look at this video a few more time!
Really love this format!!!
Loved the Keyboard Integration with the video + commentry++.. :)
Hats off for your last problem probability solution 🔥🔥.
Kamilu, jesteś najlepszym hakerem jakiego poznałem w Polsce! Życzę ci samych sukcesów, a twój talent jest na wysokim poziomie!
Congratulations!!
Congrats man!!🔥
It's just satisfying, watching at a guy who is coding fast
Much appreciated work following your videos :)
You both are legend for me
I like how you posted all the videos even though you didn't win the contest. Winning is cool but is not about the winning is about the process that everyone wants to see.
great video and nice format btw
Congrats Errictho.
Finally I could get some idea on problem c thank you man
I had solved the 3rd qn earlier in codechef long challenge , but couldn't remember it during this contest 🙂. The editorial was very nice
This type of videos are much better ❤️
This is great editing, take my like
Thank you very much !
Great video, congrats on the 2nd place!! Question, what's the software used to write/draw in the black screen? and what kind of pencil or stylus works good for it?
loved the keyboard-cam
I dont do competitive coding but this video is motivational for my coding habit
Even though I don't understand anything just watching this is so fun
Mad respect from Russia! Happy New Year!
Love the style of video 🔥🔥🔥😍😍😍
What the.... And just when I thought I was getting good at coding LOL. Great stuff man!!
it is very interesting to watch at the same time learn thanku so much
I love the keyboard-cam so I can see why cp programmer can type so quickly XD
Bro actually m from india and really like ur style solving and u r really a good competitive programmer i follow u to learn to code
Hey errichto, do you think you can cover some stuff on approximation algorithms ?? Great Content as always btw !!
Loved you video 🙏and respect.
Errichto's a cool dude
i enjoy it so much
Keyboard cam for the win!!!
Nice one Eri!
hi errichto, love your videos! watching you code encourages me to code more! Could you please make a video explaining your debug template? It seems really handy but I don't know how to use it or how it actually works. It would be very helpful for many of us if you explain it! Thand you! :)
I'm happy to see him Programming in *C* , as I'm learning it too as my first Programming language.
Hey man, I love your videos, and I really want to begin in competitive programming, I'm 18 years old, I'm not bad at maths, but what kind of maths should I know? Thanks in advance
Congrats man.
Can you make a video going more in depth on your contest set up! Loved the video!
William Lin is a genius 😱😱
At 10:02, you say the complexity of your problem C solution you achieve is O(N) and not O(N log N), however sorting the vector will surely cause your solution to run in O(N log N), no? Thanks for the quick uploads btw :)
You're right! I forgot that the input isn't sorted. It is O(N*log(N)) or could be O(sqrt(C) + N) with radix sort.
@@Errichto I thought the sort for the length of elements (say W), so the complexity is O(WlogW +N)
Kardesim yakiyorsun
@@simba187 wtf
Thank you for show your keyboard
Nice video man,
can I ask you personal question, where do you work and why not in FAANG?
or do you have own company or business related to Coding?
you are my hero
I wonder if errichto ever worked as a janitor for colleges, solving random mathematical problems on the chalkboards in the hallway.
lol how many people get the reference
Yup, I used to solve unsolvable math problems anonymously as a janitor. But that was before I was sentenced to get therapy.
Haha love that reference
How do you like them apples?
@@Errichto What reference? Lol
it was really educational thanks
Very informative 👍👍👍
In question 2, I used recursion and he did it in a more optimized way. My code passed just because the constraints were weak. Difference between noob and pro coder.
You should get AC by using as simple solution as possible. If your solution is indeed simpler than mine, you made a better choice because you saved some implementation time.
Superb 🎉🎉🎉
Thanks
O kurde, jestem w szoku! Nie wiedziałem że polakiem jesteś xD
Hey man, I am new on the programing world and I am trying to learn. Can you explain what does a terminal does and why you are always checking Guake. Thankyou
everytime I see pros like this I feel inadequate about my own skills. I need to practice lol
I got the O(n^3) approach where we define 2 random variables X1, X2.
Where X1 is the sum accumulated by merging [L, i] to a single element
Where X2 is the sum accumulated by merging [i + 1, R] to a single element
So the answer would be a another random variable X = X1 + X2 + v[i] + v[i + 1]
And By law of expectations : E[X] = E[X1] + E[X2] + v[i] + v[i + 1].
However I did not get why your approach works, can you share the mathematical steps/rules/laws you used to get to the result.
Congrats
I was not able to solve any problem but I am waiting for Google Code Jam 2021 to win it
If they give points for believing in yourself, you will be at the top for sure!
@@Errichto oofff. It isnt that easy BestPythonTutorials. Will take years to learn
@@Errichto you're vastly underestimating how blissfully ignorant some people are.
But well, nothing is impossible. Better start practicing now though.
@@Errichto thanks a lot for your suggestion
Don't be disappointed because you finished second, you are still amazing
Do you have some custom keboard settings? I find myself pressing shift more often to change numbers to symbols. Is there anyway to change the default?
nope, nothing custom
This was my first kickstart round ,got 1722 rank.I solved the first 2 parts of 3rd,knew that the 3rd question's last part was some binary search problem but couldn't do it.
codeforces mei dekha tujhe /comments mei :)
Blisko było
Graty wielkie i tak
can someone tell me what keyboard is that? it sounds amazing
Really Genius
Congrats and also very good format, easy to understand. For the last one I tried this method:
Weights(n) := an array of n values such that when you multiply with the input array you get the correct result
Weights(n) = F(Weights(n-1))
F is too weird a function to describe here but it runs in linear time with n. So this pre-processing takes O(n^2) but you can globally use it. Then for each input array of length n, it is linear to take its dot product with Weights(n).
I got the sample inputs right but kept getting wrong answer and couldnt discover the mistake. Can you spot anything immediately? Also do you think such expensive pre-processing is generally worth it if it will be globally available?
Well here we go.
F is actually like this: Sum of all vectors (p(1), p(2), p(3), ..., p(i), p(i), p(i+1), p(i+2), ..., p(n-1)) with 1
since I can't speak english well, it's hard for me to understand what is the meaning of problems.....
Can you link your keyboard? I had the same one gifted to me lol
Hi Errichto, what is the keyboard you are using?
good job keep it up
zajebiscie kamil jestem dumny
Great video - love the format!
P.S.
At 9:59, you said that your complexity is O(N), but you're doing "sort" in the beginning, so it's O(N*logN)
But that's not very important
Yup, someone has already pointed this out in comments before. It's O(N*log(N)) because of sort.
Smooth odo 😳