The 3 Levels of Binary Search

Поділитися
Вставка
  • Опубліковано 26 сер 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

КОМЕНТАРІ • 20

  • @emilypmendez
    @emilypmendez 2 роки тому +14

    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

  • @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

  • @YuvrajPathak-dm6gi
    @YuvrajPathak-dm6gi Рік тому +2

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

  • @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 2 дні тому

      seeing your comment after a year. How did you do

  • @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 Рік тому

    GREAT, pleaase more kind of this video

  • @xuda222
    @xuda222 2 роки тому +1

    No price for your bootcamp?

  • @Girlgetup__
    @Girlgetup__ 7 місяців тому

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

  • @ic6406
    @ic6406 Рік тому +1

    The most important part (3) is underelaborated

  • @fantasy2566
    @fantasy2566 Рік тому

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

  • @muhammadfarhaan6951
    @muhammadfarhaan6951 4 місяці тому

    Yes he is mr beasts brother.

  • @ImPerfectFilms
    @ImPerfectFilms 3 місяці тому +1

    Extremely hard to follow tut

  • @codenhuchoi
    @codenhuchoi 4 місяці тому

    you look like mrbeast

  • @coldspine3697
    @coldspine3697 8 місяців тому

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