Minefield Destruction Calculator | Dataford Interview Questions

Given a list of mines represented as 3-tuples (x, y, radius of explosion) - write a program which takes this input and returns the most destructive mine.

Asked in the CodeSignal coding round stage. Example input of 8 mines; expected output {-2, -2, 3.5}; chain reaction via BFS over mines in radius.

Function

def most_destructive_mine(mines):

Input

mines is a list of tuples (x, y, r).

Output

Return the tuple for the mine that can directly or indirectly trigger the largest number of other mines. If multiple mines destroy the same number, return the one with the smallest index in the input.

Constraints

1 <= len(mines) <= 10^4
Each mine is a tuple (x, y, r)
-10^9 <= x, y <= 10^9
0 <= r <= 10^9
Return the earliest mine in input order on ties

Function Signature

def most_destructive_mine(mines):

Your question is Minefield Destruction Calculator. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem