File: root - text - article - 2020 - 02 - sort-a-partially-sorted-list.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 582 Views, 25917 Search Bots | 93 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 582 Views, 25917 Search Bots | 93 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
You are given a list of n numbers, where every number is at most k indexes away from its properly sorted index. Write a sorting algorithm (that will be given the number k) for this list that can solve this in O(n log k)
Example:
Input: [3, 2, 6, 5, 4], k=2
Output: [2, 3, 4, 5, 6]
As seen above, every number is at most 2 indexes away from its proper sorted index.
Here's a starting point:
def sort_partially_sorted(nums, k):
# Fill this in.
print sort_partially_sorted([3, 2, 6, 5, 4], 2)
# [2, 3, 4, 5, 6]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 582 Views, 25917 Search Bots | 93 Words You are given a list of n numbers, where every number is at most k indexes away from its properly sorted index. Write a sorting algorithm (that will be given the number k) for this list that can solve this in O(n log k)
Example:
Input: [3, 2, 6, 5, 4], k=2
Output: [2, 3, 4, 5, 6]
As seen above, every number is at most 2 indexes away from its proper sorted index.
Here's a starting point:
def sort_partially_sorted(nums, k):
# Fill this in.
print sort_partially_sorted([3, 2, 6, 5, 4], 2)
# [2, 3, 4, 5, 6]
Related Articles
- Algorithm Interview: String Compression
- Compare Version Numbers
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- [Daily Problem] Angles of a Clock
- Spectrum Master
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- CVE-2015-8874 - cPanel EasyApache Vulnerabilities
- Print a tree level-by-level, with line-breaks
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- [Daily Problem] Remove k-th Last Element From Linked List
©2006~2024 SteakOverCooked - 0.00721 Seconds(s) - 7493.39 KB/s - 18 Online Memory: 516.47 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" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !