Meet in the Middle | Tutorial & Problems

แชร์
ฝัง
  • เผยแพร่เมื่อ 7 ก.พ. 2025
  • 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

ความคิดเห็น • 16

  • @punitpatel5565
    @punitpatel5565 2 ปีที่แล้ว +7

    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 ปีที่แล้ว +4

    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 3 ปีที่แล้ว +4

    Learnt something new. Nice...!!

  • @David-lu6np
    @David-lu6np 3 ปีที่แล้ว +1

    Great session ... Looking for more in future.

  • @ahbarahad3203
    @ahbarahad3203 3 หลายเดือนก่อน +1

    33:40 bro said skill issue 😭

  • @shreyashachoudhary480
    @shreyashachoudhary480 3 ปีที่แล้ว

    vector over sets really worked. Thanks

  • @anandverma2083
    @anandverma2083 3 ปีที่แล้ว +1

    Its my observation that in most of the problems which asks about 3 indices Meet in the middle works

  • @pypcdev7656
    @pypcdev7656 3 ปีที่แล้ว

    thanks for the nice lecture

  • @punitpatel5565
    @punitpatel5565 2 ปีที่แล้ว +1

    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.

  • @GGxEpsilon
    @GGxEpsilon 3 ปีที่แล้ว +6

    Arigato senpai (◕ᴗ◕✿)

  • @ITACHIUCHIHA-dr8sz
    @ITACHIUCHIHA-dr8sz 3 ปีที่แล้ว

    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.

  • @josephwong2832
    @josephwong2832 3 ปีที่แล้ว

    cool

  • @beastfromeast-w2d
    @beastfromeast-w2d 3 ปีที่แล้ว +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

  • @035asadali8
    @035asadali8 3 ปีที่แล้ว +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