BinarySearch Weekly Contest 25 Screencast (top3)
Переглядів 6,776
3 роки томуI tried a leetcode-like contest in a new platform, got 3rd place binarysearch.com/room/Weekly-...
Subscribe for more educational videos on algorithms, coding interviews and competitive programming.
- Main YT channel with educational videos: / errichto
- FAQ & GitHub Wiki: github.com/Errichto/youtube/w...
- Twitch: / errichto
@sourabhkhandelwal1568 3 роки тому
Seeing even legends stuggle with problems (like Errichto did with problem 2) give me some sense of hope.
@yashasvibajpai4702 3 роки тому
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. :)
@gatoradeee 3 роки тому
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?
@Errichto2 3 роки тому
I need last element not-greater than a[i], so I find first greater and then do it--.
@knowledgepoint2124 3 роки тому
Wishimg you a better luck for facebook hacker cup 2020
@shrayammitra6447 3 роки тому
In second problem i guess only checking whether any same number is consecutive or not will suffice
@ShashankTiwarisupermanhere 3 роки тому
What do you mean? Can you try this [2,3,2,3]
@shrayammitra6447 3 роки тому
@@ShashankTiwarisupermanhere yes u r correct, my hypothesis was wrong
@faijlamijunior4331 3 роки тому
Optimal solution of 2?
@priyanshusahu8024 Рік тому
is this website down?
@pratikyadav3833 3 роки тому
Today I felt that you are also a human😂
@JL-pg4pj 3 роки тому
Does it contain all binary search problems?
@menaagina7242 3 роки тому
Errichto is getting old
@Errichto2 3 роки тому
;_;
@sahilamin219 29 днів тому
@@Errichto2 What are you doing nowadays !! make a vlog :)
Мелодрама твоей души
Переглядів 2,3 млн
AKIpress news
Переглядів 4,5 млн
Суспільне Харків
Переглядів 446 тис.
Мелодрама твоей души
Переглядів 2,3 млн