Meet in the Middle | Tutorial & Problems

  Рет қаралды 25,418

Errichto Hard Algorithms

Errichto Hard Algorithms

Күн бұрын

codeforces.com...
Live chat: www.twitch.tv/...
Streaming schedule: calendar.googl...
- FAQ & GitHub Wiki: github.com/Err...
- Discord: / discord
- Twitch: / errichto
- Main YT channel with educational videos: / errichto

Пікірлер: 15
@punitpatel5565
@punitpatel5565 2 жыл бұрын
there are few nicest guys in competitive programming community or in general programming community like William Fiset from google who loves to share their knowledge. No doubt Errichto is one of them with clear understanding and full control on programming. Keep up.
@nitinpandey7478
@nitinpandey7478 3 жыл бұрын
Nice session, will love to see more in the future!!
@punitpatel5565
@punitpatel5565 2 жыл бұрын
good question was asked at @32:26 and nice answer "looking for third and fourth elements in quadraple". This helps to simplify implementation and can be applied to other questions as well like dynamic programming questions.
@sumitprajapati821
@sumitprajapati821 2 жыл бұрын
Learnt something new. Nice...!!
@anandverma2083
@anandverma2083 3 жыл бұрын
Its my observation that in most of the problems which asks about 3 indices Meet in the middle works
@David-lu6np
@David-lu6np 3 жыл бұрын
Great session ... Looking for more in future.
@shreyashachoudhary480
@shreyashachoudhary480 2 жыл бұрын
vector over sets really worked. Thanks
@punitpatel5565
@punitpatel5565 2 жыл бұрын
Just curious if anyone was looking for nlogn solution using fenwick tree. since we are looking for number of elements which are less than b on left hand side and greater than b on right hand side, we just need to maintain two fenwick trees one for left side view and one for right side view. Using sweep line we can maintain both dynamically and calculate answer.
@pypcdev7656
@pypcdev7656 2 жыл бұрын
thanks for the nice lecture
@GGxEpsilon
@GGxEpsilon 3 жыл бұрын
Arigato senpai (◕ᴗ◕✿)
@ITACHIUCHIHA-dr8sz
@ITACHIUCHIHA-dr8sz 2 жыл бұрын
In the four sum problem wouldn't the count of pairs with distinct positions be wrong if there are duplicates for example for this input 8 15 3 2 3 2 8 1 3 2 ans is 12.
@mukulkumar2316
@mukulkumar2316 3 жыл бұрын
Can you please do stack and queues algorithms?? If you have already done some stream or problems about it, somebody plz share the video title. Thanks
@josephwong2832
@josephwong2832 2 жыл бұрын
cool
@035asadali8
@035asadali8 2 жыл бұрын
i see p5 and when i hear graph i stop the video bcoz i dont know a single algorithm about graph ,i see the video again after learning and practicing graph,i dont know dp either ,so sad
@HassanFathi2002
@HassanFathi2002 9 ай бұрын
you just need خنجرين
Easy Coding Problems (Reply Code Challenge Teen Edition)
1:05:24
Errichto Hard Algorithms
Рет қаралды 8 М.
6 Easy Codeforces Problems
1:33:15
Errichto Hard Algorithms
Рет қаралды 14 М.
escape in roblox in real life
00:13
Kan Andrey
Рет қаралды 80 МЛН
LeetCode was HARD until I Learned these 15 Patterns
13:00
Ashish Pratap Singh
Рет қаралды 347 М.
[Hard] Square Root Decomposition - Homework
1:13:50
Errichto Hard Algorithms
Рет қаралды 6 М.
Google Hash Code 2022 Quals Upsolving
1:12:30
Errichto Hard Algorithms
Рет қаралды 8 М.
Winning Codeforces Round 971 (Div. 4) in honor of @que_tourist
1:39:42
Intro to Competitive Programming
11:41
Junferno
Рет қаралды 776 М.
Google Hash Code practice
2:47:40
Errichto Hard Algorithms
Рет қаралды 11 М.
The Black Box Method: How to Learn Hard Concepts Quickly
14:09
Colin Galen
Рет қаралды 1,1 МЛН
Codeforces Edu 142 (Div. 2) live coding
1:21:06
Errichto Hard Algorithms
Рет қаралды 12 М.
Codeforces Good Bye 2022 live coding
3:02:48
Errichto Hard Algorithms
Рет қаралды 10 М.
Meet in the middle algorithm
15:01
Techdose
Рет қаралды 16 М.