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 | 292 Views, 32973 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 | 292 Views, 32973 Search Bots | 87 Words Subscribe to Feed Burner

Related Articles

  1. How to Play WAV music under DOS?
  2. Kaprekar
  3. Daily Interview Puzzle: Falling Dominoes
  4. Find Missing Numbers in an Array
  5. Plus One
  6. Binary Tree Level with Minimum Sum
  7. Skip the readings, focus on problems. And use all the hints!
  8. Detect Linked List Cycle
  9. Autorun.inf Virus Protection
  10. Daily Interview Problem: Validate Binary Search Tree

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />