Round 1: Technical questions
- Common data structures and algorithms (search in sorted list, search in linked list, red-black-tree)
- How would you implement a priority queue?
- HashMap collision resolution strategies
- Examples of probabilistic data structures, advantages
- Difference between functional and imperative programming.
- How would you represent a graph in-memory?
- Difference between columnar and row based database.
- Difference between inner and outer join.
- Explain MapReduce.

Question

Round 1: Technical questions
- Common data structures and algorithms (search in sorted list, search in linked list, red-black-tree)
- How would you implement a priority queue?
- HashMap collision resolution strategies
- Examples of probabilistic data structures, advantages
- Difference between functional and imperative programming.
- How would you represent a graph in-memory?
- Difference between columnar and row based database.
- Difference between inner and outer join.
- Explain MapReduce.

Spotify

Pergunta de entrevista da empresa Spotify

Empresas seguidas

Buscas de vagas