Acudí a una entrevista en Squarepoint Capital (Londres, Inglaterra)
Entrevista
2 x 60 mins phone interviews, followed by an onsite challenge. For the phone interviews, typical technical, brainteaser style interview and hacker rank style coding problems. The onsite is a full-day data challenge. Failed at the second phone interview, probably because they didn't like I did not know hashmaps. (I'm not a CS guy)
Preguntas de entrevista [1]
Pregunta 1
Coding: Array length n. Integer k. Find the minimum sub-array length (no elements can be skipped) for which the sub-array has at least k distinct elements. If no such sub-array exists return -1. Implement naively. What is the complexity. Implement efficiently
