Loading Question...

Game of Names - Amazon ML Summer School Interview Question | Codinzhub

Game of Names

Given a list of names and a grid of characters, determine which players are valid and their positions in the grid. A player is valid if they have exactly 11 characters in their name and all characters in their name appear in the grid at least once. The grid is represented as a 2D array of characters, and the names are represented as a list of strings. The output should be a list of tuples, where each tuple contains the name of a valid player and their position in the grid.

Example 1:

Input:{"N": 5, "names": ["alan", "bob", "charlie", "david", "ellen"], "grid": [["a", "b", "c", "d", "e"], ["f", "g", "h", "i", "j"], ["k", "l", "m", "n", "o"], ["p", "q", "r", "s", "t"], ["u", "v", "w", "x", "y"]], "M": 5, "clues": ["alan", "bob", "charlie", "david", "ellen"]}

Output:[('alan', 0), ('bob', 1), ('charlie', 2), ('ellen', 4)]

Example 2:

Input:{"N": 3, "names": ["a", "bb", "ccc"], "grid": [["a", "b", "c"], ["d", "e", "f"], ["g", "h", "i"]], "M": 3, "clues": ["a", "bb", "ccc"]}

Output:[('a', 0), ('bb', 1)]

Constraints:

1 <= N <= 10^5
1 <= M <= 10^5
1 <= grid.length <= 10^5
1 <= grid[0].length <= 10^5
1 <= name.length <= 11
name consists of lowercase English letters
grid[i][j] consists of lowercase English letters

solution.cpp

Run code to see test results

00:00 / 69:42

Game of Names

MediumMed•207 views

Example 1:

Output:[('alan', 0), ('bob', 1), ('charlie', 2), ('ellen', 4)]

Example 2:

Input:{"N": 3, "names": ["a", "bb", "ccc"], "grid": [["a", "b", "c"], ["d", "e", "f"], ["g", "h", "i"]], "M": 3, "clues": ["a", "bb", "ccc"]}

Game of Names

Example 1:

Example 2:

Constraints:

Game of Names

Example 1:

Example 2:

Constraints:

Author: Amit Dayal

Up Next

Data Frame - Flipkart Grid 8.0

Megastore Partitioning - Flipkart Grid 8.0

Marathon Checkpoints - Flipkart Grid 8.0

SQL - Flipkart Grid 8.0

Data Frame