File: root - text - article - 2019 - 12 - min-range-needed-to-sort.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 404 Views, 16796 Search Bots | 70 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 404 Views, 16796 Search Bots | 70 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Twitter:
Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.
Example:
Input: [1, 7, 9, 5, 7, 8, 10]
Output: (1, 5)
Explanation:
The numbers between index 1 and 5 are out of order and need to be sorted.
Here's your starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 404 Views, 16796 Search Bots | 70 Words Given a list of integers, return the bounds of the minimum range that must be sorted so that the whole list would be sorted.
Example:
Input: [1, 7, 9, 5, 7, 8, 10]
Output: (1, 5)
Explanation:
The numbers between index 1 and 5 are out of order and need to be sorted.
Here's your starting point:
def findRange(nums):
# Fill this in.
print findRange([1, 7, 9, 5, 7, 8, 10])
# (1, 5)
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Spectrum Master
- Daily Interview Puzzle: Falling Dominoes
- A trick for getting good at coding interviews FASTER
- Delphi Dynamic Array
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Algorithm Interview Question: Symmetric k-ary Tree
- [Daily Problem] Remove k-th Last Element From Linked List
- Print a tree level-by-level, with line-breaks
- Daily Interview Problem: Circle of Chained Words
- [Daily Problem] Course Prerequisites
©2006~2024 SteakOverCooked - 0.0101 Seconds(s) - 5344.932 KB/s - 61 Online
Memory: 516.91 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !