BinarySearch Weekly Contest 25 Screencast (top3) 

Seeing even legends stuggle with problems (like Errichto did with problem 2) give me some sense of hope.

Now you'll make me fall in love with Binary Search! Errichto, I want to let you know that you are treated as the John Wick of CP in the competitive coding community and it is really awesome how you give back to the community with these fantastic videos!!! Thanks man. :)

31:42 why is upper_bound used instead of lower bound? We want the first element that does not compare greater than a[i] right?

In second problem i guess only checking whether any same number is consecutive or not will suffice

is this website down?

Optimal solution of 2?

Wishimg you a better luck for facebook hacker cup 2020

Does it contain all binary search problems?

Today I felt that you are also a human😂

Errichto is getting old