Envié una solicitud electrónica. Acudí a una entrevista en HPR
Entrevista
1 recruiter phone screening, 2 standard leetcode easy / mediums, then 1 system design interview. All code was entirely written in C and there's no C++ available which threw me off. All technical rounds also featured a little resume grilling at the end and some general technical questions. Interview was really fun though! Everyone was super knowledgeable and sweet.
Preguntas de entrevista [1]
Pregunta 1
Many typical C style questions, what's the difference between C and C++ when programming, what are the different memory allocation patterns. And then a discussion on what your best project was and how it was designed.
OA, 2 questions C/C++, 1 question forced C. Know C.
Phone screen with HR.
For technical linked list question in C. Know some networking trivia as well (protocols/tradeoffs). Not algorithmically difficult but must know C.
Preguntas de entrevista [1]
Pregunta 1
Would you use UDP or TCP for a given trading system.
Envié una solicitud electrónica. El proceso duró 2 semanas. Acudí a una entrevista en HPR (Needham, MA) en oct 2022
Entrevista
Applied online, as well as reached out to head university recruiter (Avery Hale). Process went OA (did not ace) -> phone screen -> 2x45 technical, 1x45 informal chat w/ director -> offer. Note that OA is only offered in C, and same with technicals. It is expected that you know your way around C regarding syntax, and to a lesser extent, the lower level parts of C (bitwise operations, etc). For the 2x45 technical, it was maybe 15 minutes, 20 minutes of behavioral/technical Q&A, then 25-30 minutes of coding problem. The chat with the tech director had NO technical or behavioral, just a conversation about what it's like to be an intern at HPR.
Preguntas de entrevista [1]
Pregunta 1
If a computer has clock freq of 3 GHz, and a program on that computer has a runtime of 360 ns, how many instructions executed in the prog runtime? What's a computer thread? What's TCP/IP? What's a hash map? How does it handle collisions? What's the average and worst-case runtime of hash table operations? Tradeoffs between linked list and array, and when you would use each one CODING QUESTIONS: make this function: bool isPrime(uint8_t num) now make it O(1) find a cycle in a linked list
