To the Top
File:  root - text - article - 2019 - 10 - non-decreasing-array-with-single-modification.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 538 Views, 31285 Search Bots | 126 Words

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

You are given an array of integers in an arbitrary order. Return whether or not it is possible to make the array non-decreasing by modifying at most 1 element to any value.

We define an array is non-decreasing if array[i] <= array[i + 1] holds for every i (1 <= i < n).

Example:

[13, 4, 7] should return true, since we can modify 13 to any value 4 or less, to make it non-decreasing.

[13, 4, 1] however, should return false, since there is no way to modify just one element to make the array non-decreasing.

Here is the function signature:


def check(lst):
# Fill this in.

print check([13, 4, 7])
# True
print check([5,1,3,2,5])
# False


Can you find a solution in O(n) time?
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 538 Views, 31285 Search Bots | 126 Words Subscribe to Feed Burner

Related Articles

  1. Number of Ways to Climb Stairs
  2. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  3. Daily Interview Problem: Distribute Bonuses
  4. Daily Interview Puzzle: Intersection of Linked Lists
  5. CPU Utilization
  6. [Daily Problem] Longest Palindromic Substring
  7. Algorithm Interview Question: Max and Min with Limited Comparisons
  8. How to Play WAV music under DOS?
  9. Algorithm Interview Question: Find the Single Element in an Array of Duplicates
  10. Daily Interview Problem: Group Words that are Anagrams

Comments (0)

    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="index, follow">