Me postulé a través de una recomendación de un empleado. El proceso tomó 4 semanas. Acudí a una entrevista en Intel Corporation (San Jose, CA) en abr 2022
Entrevista
I would like to mention that this interview was a one-on-one interview with 5 people, which lasted a total of 2 and a half hours long interview, there was no break but time flew by.
Preguntas de entrevista [1]
Pregunta 1
this interview was for the rotation program.
the people I interviewed were friendly and made the interview process fun. They asked fun questions like (1) telling me what you would do if your router shuts down(this type of question was done to see if you had good problem-solving skills) (2) They asked questions like what makes up an FPGA, what are the components, difference between an ASIC and FPGA (3) Asked questions on what was found on my resume. After these technical questions, we had fun conversations and I gained a lot from the team.
Me postulé a través de una recomendación de un empleado. El proceso tomó 3 semanas. Acudí a una entrevista en Intel Corporation (San Jose, CA) en abr 2022
Entrevista
1 phone call interview
then 5 thirty minutes long 1:1 interviews
the second interview lasted 2 and a half hours
Very fun interview, glad I enjoyed this interview.
Technical interview questions, no behavioral but behavioral was disguised/together with technical questions. Regular conversations with them highlighted skills such as team work e.t.c
Preguntas de entrevista [1]
Pregunta 1
questions on my resume
They didn't really ask behavioral questions
Very fun interview
Me postulé en persona. El proceso tomó 1 semana. Acudí a una entrevista en Intel Corporation (Toronto, ON) en oct 2019
Entrevista
Two interviewers met with me separately for about 30 minutes and they were both highly technical. One focused on problem solving and programming a solution with math, while the other focused on advanced programming, asking a linked list problem with several rules.
Preguntas de entrevista [1]
Pregunta 1
Given a vector of inputs x[i] and a vector of outputs y[i] where each output is the product of all the inputs not in that index. Write a program which gives this output. What is the complexity of that program?
Is there a way to make it faster?