Grokking LinkedIn Coding Interview

0% completed

​
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content

.....

.....

.....

Like the course? Get enrolled and start learning!
Mohammed Dh Abbas

Mohammed Dh Abbas

· 2 years ago



class Solution:
  def search(self, arr, key):
    # standard binary search 
    def binary_search(b, e):
      while b <= e:
        m = (b + e) // 2
        if arr[m] == key:
          return m 
        elif arr[m] < key:
          b = m + 1
        else:
          e = m - 1
      return -1

    '''
      original array 
      1 2 3 4 5 6 7 8 9 10 11 12

      case: 1 b < m > e
      4 5 6 7 8 9 10 11 12 1 2 3
      ^           ^            ^
      b           m            e
      if key in the sorted range 
          do binary search 
      else:
          discard the sorted side
          
      case 2:  b > m < e
      10 11 12 1 2 3 4 5 6 7 8 9
      ^          ^             ^
      b          m             e
      if key in the sorted range 
          do binary search
Show 1 reply