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

Related Articles

  1. Find Missing Numbers in an Array
  2. Daily Interview Problem: Room scheduling
  3. [Daily Problem] Validate Balanced Parentheses
  4. Daily Interview Problem: Spiral Traversal of Grid
  5. Design Tic-Tac-Toe
  6. Daily Interview Problem: Buddy Strings
  7. How to Play WAV music under DOS?
  8. Daily Interview Problem: Min Range Needed to Sort
  9. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  10. Find Pythagorean Triplets

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: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />