Amazonseniormar. de 2026
You have a data set of stars (like stars in the night sky) in a very large 2-dimensional space, each with an x and y coordinate and some attributes.
Count the number of islands (4-directionally connected components of '1's) in an m×n binary grid. This is a connected-components/flood-fill problem typically solved with DFS/BFS or Union-Find in O(mn) time (m,n ≤ 300).
Use esses exemplos para entender em que contexto ela costuma cair e adaptar sua prática.
You have a data set of stars (like stars in the night sky) in a very large 2-dimensional space, each with an x and y coordinate and some attributes.
Paint bucket algorithm
Asked in the first technical screening round
Nenhum anexo público associado a esta pergunta.
No app você encontra perguntas parecidas, compara empresas e aprofunda essa busca com mais filtros.