LeetCode Biweekly Contest 11 screencast with commentary

I'm participating in Leetcode contest with semi-live commentary. Will I win?
leetcode.com/c...
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.
- Frequently Asked Questions: github.com/Err...
- Github repository: github.com/Err...
- KZbin channel 1: / errichto (lectures and single problems)
- KZbin channel 2: / errichto2 (streams)
- Competitive Programming Discord: discordapp.com...

[@Errichto]

I'm starting a live stream in 15 minutes, talking about Kickstart first! kzbin.info/www/bejne/rWS6Xqpmer14qsU

[@rogernadal9106]

Amazing idea to bring Errichto from future to do a commentary, Love it !!!

[@Errichto]

It's funny that I also didn't need headphones while watching a recording without sound :D

[@sazzadrume]

looks cool though!

[@bttmndl]

i am learning from no 2 rank holder in codejam....that's enough for me to be inspired

[@ajr1791ze]

Not to look at leaderboard till contest. "A new thing I learned from you :)"

[@samsi2603]

Commentary from the future is always welcome

[@aliabdurahmanov8371]

thanks man. you're doing a great job for CP community.

[@Endede]

For sure keep adding "Comments from the Future". It's very interesting, and actually very educational to follow how a pro like you thinks and solves under pressure. It was also great to see that you ran into some of the same complications as I did. (Although I have no chance to ever place as high as you did so casually. I barely made the Top 200). As for it being your first leetcode contest. It seemed to me that this week, all the top placed participants had an unusually high count of still buggy submissions compared to what I have seen in previous contests.

[@Sulverus]

Very nice. This is exactly what I'm looking for. This is very cool to look this video right after the contest. Hope you will create more leetcode videos=)

[@shreyanshsingh2627]

Love the idea of bringing future self for commentary. Your videos have real humorous fun elements

[@shivambhalla470]

The best commentary.. solved all my doubt thank u sir

[@navjot7397]

You are a legend, thanks for making this great video and explaining everything so calmly.

[@RishabhDeepSingh]

The best commentary

[@qwoijzacxoi]

+1 from the future commentary, great watch!

[@nikhilkumar-ot9rn]

thanks a lot..u are doing great job..and this format is very best..

[@1.5millionsubscribers35]

Please do commentary and also explain your approach because it's not so easy to understand how did you think that this problem can be solved this way for example how did you figure out that in last problem you should use binary search. Thanks waiting for next video 👍

[@007007justin]

This video was really good and commentary idea from future is also good make more such videos great work

[@zuzu7326]

Thanks for commentary

[@hoarsebees]

Thanks for posting this, I like the commentary format. Instead of focusing on your mistakes in your commentary I would have liked you to explain your successes, I could not keep up with your solutions!

[@baba-if5su]

wow, Errichto reacts to Errichto !! amazing

[@mzmzgreen]

Great video I like the fact that you added commentary :) In first task you're computing the common difference using formula: (last - first)/n. Why does it work? Is it a known formula? How can we proof that it's correct?

[@shrad6611]

Watch solving you these questions be like "cutting nails with sword " hahahaha

[@paroxyzm21]

Maybe to get rid of scrolling you could simply open the problems on 2 monitors?

[@imtoor]

Awesome 🔥🔥🔥

[@abhigupta6681]

Hi errichto! I like your content a lot. If possible, please take a class on binary search

[@Errichto]

I already made a lecture on Binary Search kzbin.info/www/bejne/fYaadaOdfa6BjbM

[@pranupranav5563]

Use Sn-(sum of array)

[@richardf.1353]

in your first try on first problem, if difference is 0 we get a IndexOutOfBounds right? so we should just check if diff==0 before going into the loop? -Edit nvm i watched through

[@Errichto]

Yup, that was a mistake :_:

[@gatoradeee]

Someone explain how the recurrence works in problem 3, toss strange coins. I don't understand the dp * (1-p) part

[@gatoradeee]

wow ok so binomial distribution

[@shameemahmed9161]

Is leetcode good for coding interviews for product based companies?

[@TanUv90]

I think the commentary is good.

[@zuzu7326]

your mid (low+high+1)/ 2 could be overflow

[@Errichto]

How? Low and High are up to 10^9.

[@zuzu7326]

@@Errichto In this problem, there is no overflow ( 0 and 10^9 limit). Could overflow if the low and high limit is more.

[@gmmkeshav]

how many job offers do you get?

[@ajr1791ze]

can you make videos on tries.

[@Errichto]

One day I will. First trees and graphs though.

[@ajr1791ze]

@@Errichto ok. thanks.

[@sumantopal558]

NEED TUTORIAL FOR STL!!!!