Envié una solicitud electrónica. El proceso duró 4 semanas. Acudí a una entrevista en MathWorks (Natick, MA) en mar 2025
Entrevista
OA, then 1 interview and some phone calls/ email correspondance. OA wasn't too bad; they considered resume more than OA anyway. I got a problem wrong on the OA and still got the job.
Preguntas de entrevista [1]
Pregunta 1
Given two unsorted arrays a[] and b[]. Both arrays may contain duplicate elements. For each element in a[], find the count of elements in b[] are less than or equal to that element.
1.resume follow up questions
2.explain the logic that you solved in OA
3.new hackerank question to solve you are supposed to tell the approach ,write the code and handle edge cases.
Resume grill that was asking a bit more about relevant works and a technical section with a leet code medium level question, was pretty chill and enjoyable. interviewer was nice
Hackerrank OA (1 medium, 1 hard) followed by a technical interview (discuss your submission to one out of the two questions from OA + 1 medium LC + OOPS + resume discussion).
Preguntas de entrevista [1]
Pregunta 1
Hackerrank OA (1 medium, 1 hard) followed by a technical interview (discuss your submission to one out of the two questions from OA + 1 medium LC + OOPS + resume discussion).
