To the Top
File:  root - text - article - 2019 - 10 - daily-problem-first-and-last-indices-of-an-element-in-a-sorted-array.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 227 Views, 27852 Search Bots | 87 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

Given a sorted array, A, with possibly duplicated elements, find the indices of the first and last occurrences of a target element, x. Return -1 if the target is not found.

Example:
Input: A = [1,3,3,5,7,8,9,9,9,15], target = 9
Output: [6,8]

Input: A = [100, 150, 150, 153], target = 150
Output: [1,2]

Input: A = [1,2,3,4,5,6,10], target = 9
Output: [-1, -1]
Here is a function signature example:


class Solution:
def getRange(self, arr, target):
# Fill this in.

# Test program
arr = [1, 2, 2, 2, 2, 3, 4, 7, 8, 8]
x = 2
print(Solution().getRange(arr, x))
# [1, 4]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 227 Views, 27852 Search Bots | 87 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem:Create a balanced binary search tree
  2. Find Pythagorean Triplets
  3. Kaprekar
  4. [Daily Problem] Remove k-th Last Element From Linked List
  5. Algorithm Interview: Shifted String
  6. Plus One
  7. [Daily Problem] Add two numbers as a linked list
  8. Daily Interview Problem: First Missing Positive Integer
  9. Algorithm Interview: Subarray With Target Sum
  10. Daily Interview Problem: Running Median

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">