Find Building Where Alice and Bob Can Meet | Segment Tree | Binary Search | Leetcode 2940

Поделиться
HTML-код
  • Опубликовано: 21 дек 2024

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

  • @AbdurRahim-ry7tj
    @AbdurRahim-ry7tj 5 часов назад +1

    very neat and clean explanation

  • @akshatgupta2607
    @akshatgupta2607 2 часа назад

    What an explaination Sir , hatsoff

  • @arukanwar
    @arukanwar 9 часов назад +2

    Nice Explanation 👍

  • @BananaButcher
    @BananaButcher 6 часов назад +1

    amazing explanation

  • @praveenrajrs
    @praveenrajrs 7 часов назад +1

    does the binary search is applicable for unsorted array ?

    • @techdose4u
      @techdose4u  6 часов назад +1

      It is not on the logic of sorted array but on getting leftmost max value.
      Some more complex version of usual binary search :)

    • @AbdurRahim-ry7tj
      @AbdurRahim-ry7tj 5 часов назад

      index is sorted

  • @selva_274
    @selva_274 11 часов назад +1

    Thanks bro

  • @onlywrestling7810
    @onlywrestling7810 2 часа назад

    Python code is giving TLE