The 3 Levels of Binary Search

Поделиться
HTML-код
  • Опубликовано: 3 окт 2024
  • When most people think of Binary Search, they think of finding a number in a sorted array. And while that IS binary search, there's a lot more that you can do with it than that.
    Especially in coding interviews when interviewers ask more involved problems, understanding the complexities of binary search can be really valuable.
    In this video, I'll show you some of the different ways that you can apply binary search to interview problems.
    RESOURCES & LINKS MENTIONED IN THIS VIDEO:
    [Free Training] Minimum Viable Interview Prep: www.byte-by-by...
    Coding Interview Questions and Answers Playlist: • Interview Question: Fi...
    YOU CAN ALSO FIND ME HERE
    Website: www.byte-by-by...
    Twitter: / bytebybyteblog
    Facebook: / bytebybyteblog

Комментарии • 22

  • @emilypmendez
    @emilypmendez 2 года назад +15

    Your lectures are great. Could you do more videos like this breaking it down from Easy to Hard levels? This is my first time engaging with your video channel!

    • @ByteByByte
      @ByteByByte  2 года назад +2

      Much appreciated. Definitely planning to do more videos like this

  • @cmxiang
    @cmxiang 14 дней назад

    This is very helpful, thank you!

  • @YuvrajPathak-dm6gi
    @YuvrajPathak-dm6gi Год назад +2

    this is the only video available on youtube which talks about this concept

  • @jlecampana
    @jlecampana 2 года назад +4

    And that's not the end of it, A lot of problems have a "Hidden", or rather obscure Binary Search Solution. One good example is the "Kth Smallest element in a sorted Matrix" problem.

    • @ByteByByte
      @ByteByByte  2 года назад +1

      Yeah for sure. Kinda like graph problems where they're completely non-obvious

    • @anonyfeed1076
      @anonyfeed1076 2 года назад +2

      Like Kokos eating bananns problem

  • @Alex911sc2
    @Alex911sc2 2 года назад +1

    Great lecture! I wonder if we can optimize the last problem using a running sum.

  • @Petej34x
    @Petej34x 2 года назад +3

    Great lecture, thank you

    • @ByteByByte
      @ByteByByte  2 года назад

      Glad you found it helpful :)

  • @nasimajosefi
    @nasimajosefi 2 года назад

    GREAT, pleaase more kind of this video

  • @ImPerfectFilms
    @ImPerfectFilms 4 месяца назад +3

    Extremely hard to follow tut

  • @ic6406
    @ic6406 Год назад +1

    The most important part (3) is underelaborated

  • @xuda222
    @xuda222 2 года назад +1

    No price for your bootcamp?

  • @Girlgetup__
    @Girlgetup__ 8 месяцев назад

    I'm not understanding how 2 is less than 7 but 1 is greater than 7.. shouldn't 2 be greater than 7 also?

    • @dhruvsaxena8254
      @dhruvsaxena8254 24 дня назад

      11:05 it's greater than 7 OR less than 3 , similarly the next group will be greater than 7 OR less than 2 and so on ...

  • @fantasy2566
    @fantasy2566 Год назад

    arr = list(map(int, input().split()))
    num = int(input())
    l = 0
    r = len(arr) - 1
    cnt = 0
    while l

  • @muhammadfarhaan6951
    @muhammadfarhaan6951 5 месяцев назад

    Yes he is mr beasts brother.

  • @coldspine3697
    @coldspine3697 9 месяцев назад

    I wanted to watch the video but your light mode screen is blinding me. Please use a black slate

  • @codenhuchoi
    @codenhuchoi 5 месяцев назад

    you look like mrbeast

  • @tibettenballs4962
    @tibettenballs4962 2 года назад

    you are a legend amongst algo tutors.
    recent business graduate. have technical interviews with apple and amazon. (project managers liked my side projects). also have been coding since a kid.
    have never taken an exam for algos + ds. and you have helped me tremendously this week.
    the array tricks / middle school math i learnt earlier is golden!

    • @myname9114
      @myname9114 Месяц назад

      seeing your comment after a year. How did you do