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 314 #640

Closed
vaskoz opened this issue Jul 2, 2019 · 0 comments · Fixed by #641
Closed

Day 314 #640

vaskoz opened this issue Jul 2, 2019 · 0 comments · Fixed by #641
Assignees

Comments

@vaskoz
Copy link
Owner

vaskoz commented Jul 2, 2019

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

This problem was asked by Spotify.

You are the technical director of WSPT radio, serving listeners nationwide. For simplicity's sake we can consider each listener to live along a horizontal line stretching from 0 (west) to 1000 (east).

Given a list of N listeners, and a list of M radio towers, each placed at various locations along this line, determine what the minimum broadcast range would have to be in order for each listener's home to be covered.

For example, suppose listeners = [1, 5, 11, 20], and towers = [4, 8, 15]. In this case the minimum range would be 5, since that would be required for the tower at position 15 to reach the listener at position 20.

@vaskoz vaskoz self-assigned this Jul 2, 2019
@vaskoz vaskoz mentioned this issue Jul 3, 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