three technical interviews-one is a kind of riddle solved by pseudo code, second and third are data analysis regarding which data is relevant to an AI algorithm and which evaluation metrics are relevant to the goal.
Perguntas de entrevista [1]
Pergunta 1
write a function that identifies self-descriptive number.
The interview process was quick, clear, and well-organized. Communication was prompt, expectations were explained, and I received feedback very fast, even though I did not pass to the next stage.
Perguntas de entrevista [1]
Pergunta 1
There was a probability and logic question about computer cores, a coding question where I had to find the lowest sub-sum of a sequence, and another question related more to confusion matrices and identifying defective items.
Candidatei-me por indicação de um funcionário. O processo levou 1 dia. Fui entrevistado pela Intel Corporation (Petah Tikva) em jul. de 2025
Entrevista
Phone interview -> Technical interview (consists of 3 parts: programming, data analysis, logical riddle) -> manager interview. The technical part is considerably hard in terms of pure knowledge, but they focus on logical taught process.
Perguntas de entrevista [1]
Pergunta 1
1. Fictional company data analysis
2. Find max sub array in a given array comprises of integers (programming)
3. Riddle about finding the fastest horses out of 25 horses. In each race there is only 5 horses, and you can only know the positions at the end, not the times. The purpose is to find the least amount of races to do in order to find the 3 fastest horses
Fiz uma entrevista na empresa Intel Corporation (Haifa).
Entrevista
3 different interviews (each with a different interviewer) on microsoft teams:
1. Technical interview with a question in python
2. Questions related to ai concepts
3. Questions related to the business aspect
Perguntas de entrevista [1]
Pergunta 1
Technical python question:
You get cards as an input and you need to suffle the cards using only Rand[a,b] function (returns a random natural number in the range a to b).
