Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Day 306 #626

Closed
vaskoz opened this issue Jun 24, 2019 · 0 comments · Fixed by #627
Closed

Day 306 #626

vaskoz opened this issue Jun 24, 2019 · 0 comments · Fixed by #627
Assignees

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jun 24, 2019

Good morning! Here's your coding interview problem for today.

This problem was asked by Palantir.

You are given a list of N numbers, in which each number is located at most k places away from its sorted position. For example, if k = 1, a given element at index 4 might end up at indices 3, 4, or 5.

Come up with an algorithm that sorts this list in O(N log k) time.

@vaskoz vaskoz self-assigned this Jun 24, 2019
@vaskoz vaskoz mentioned this issue Jun 25, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant