J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez MathWorks en oct. 2016
Entretien
I talked to a technical recruiter at my school's career fair and a couple days later I received an email from a corporate recruiter to set up a phone call.
The phone call took less than 15 minutes and I got to ask a couple of questions about the company. The recruiter said that she would forward my information to a hiring manager and they would determine if I'd be moving on to the next step.
I found out the next day the "match was not ideal" - I would suggest MathWorks forward a candidate's information to a hiring manager BEFORE setting up a phone call in order to not waste the recruiter's and candidate's time.
Questions d'entretien [1]
Question 1
How do you manage your time/deadlines?
What are you looking for in a job when considering companies?
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