J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez MathWorks (New York, NY) en oct. 2016
Entretien
The first round was a 15 minutes phone interview with HR. Next round was a hacker-rank session before the technical phone interview. For hacker-rank test, there were 4 questions and one question was to be chosen from the first two and one from the last two. The questions were not hard; however, I didn't read the instruction carefully so I answered any two which was my mistake. Phone interview mostly focused on my solution for hackerrank and OOP.
What really bothered me was that they did not even send an email saying that I was rejected, I checked my online application after a few days and found out.
Questions d'entretien [1]
Question 1
How do you handle multitasking?
What are you looking for in a company when you apply for a job?
For technical part, the questions were very similar to the ones mentioned in glassdoor.
You will have to complete a hirevue and then a hacker rank assessment with a few coding questions and matlab multiple choice questions. You get plenty of time to complete the hacker rank assessment.
J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez MathWorks en nov. 2023
Entretien
Two stage testing process which was automated: the first part was generally what I would describe as math or logical puzzle solving and the second part was code focused. There was the option to complete the interview testing in MATLAB or C or Java. It was reminiscent of standardized testing in some ways. As an alternative to the standardized test format there was a HackerRank coding option as well.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez MathWorks (Bengaluru) en sept. 2021
Entretien
Online Round (2 DP problems and MCQs).
GD round (EDG and challenges facing in EDG).
Tech Round (Spiral traversal of the array).
Managerial Round(As usual managerial round questions ).
HR round(As usual HR round)
Questions d'entretien [1]
Question 1
K-times rotate linked list, SPiral traversal of the array, c++ technical questions
