Aller au contenuAller au pied de page
  • Emplois
  • Entreprises
  • Salaires
  • Pour les employeurs

      Boostez votre carrière

      Découvrez votre salaire potentiel, décrochez des emplois de rêve et partagez vos témoignages de manière anonyme.

      employer cover photo
      employer logo
      employer logo

      MathWorks

      Employeur impliqué

      À propos
      Avis
      Salaires et avantages
      Emplois
      Entretiens
      Entretiens
      Recherches associées: Avis sur MathWorks | Offres d’emploi chez MathWorks | Salaires chez MathWorks | Avantages sociaux chez MathWorks
      Entretiens chez MathWorksEntretiens d’embauche pour Software Engineering chez MathWorksEntretien chez MathWorks


      Glassdoor

      • À propos
      • Récompenses
      • Blog
      • Nous contacter
      • Guides

      Employeurs

      • Compte employeur gratuit
      • Centre employeur
      • Blog pour les employeurs

      Informations

      • Aide
      • Règles de la communauté
      • Conditions d'utilisation
      • Confidentialité et choix publicitaires
      • Ne pas vendre ni partager mes informations
      • Outil de consentement aux cookies

      Travailler avec nous

      • Annonceurs
      • Carrières
      Télécharger l'application

      • Parcourir par :
      • Entreprises
      • Emplois
      • Lieux

      Copyright © 2008-2026. Glassdoor LLC. « Glassdoor », son logo, « Worklife Pro » et « Bowls » sont des marques déposées de Glassdoor LLC.

      Entreprises suivies

      Tenez-vous au courant des dernières opportunités et profitez de conseils d’initiés en suivant les entreprises de vos rêves.

      Recherche d’emplois

      Obtenez des recommandations et des mises à jour personnalisées en démarrant vos recherches.

      Entretien pour Software Engineering

      11 août 2022
      Candidat à l'entretien anonyme
      Offre refusée
      Expérience positive
      Entretien facile

      Candidature

      J'ai postulé en ligne. J'ai passé un entretien chez MathWorks

      Entretien

      Was pretty relaxed- just explain your thinking. There was a code test online - including maths and programming. Then I had to submit an extended response regarding my motivations etc. Then there was a technical interview - asking about some engineering maths, coding and programming concepts. Then a general non technical interview with the manager.

      Questions d'entretien [1]

      Question 1

      What are the concepts of OOP?
      1 réponse

      Autres retours d’entretien d’embauche pour un poste comme Software Engineering chez MathWorks

      Entretien pour Software Engineering

      25 nov. 2021
      Candidat à l'entretien anonyme
      Aucune offre
      Expérience négative
      Entretien moyen

      Candidature

      J'ai passé un entretien chez MathWorks

      Entretien

      I attended a Career Fair event and applied online after attending the event, which shortly led to a behavioral assessment where I had to record myself and send them the videos of my responses. After that, I was sent a HackerRank take home assessment. Upon successful completion of those two, I was interviewed by an engineer on behavioral and technical questions. I thought I did well and solved the problem successfully. This is where it goes south. I reached out 1-2 weeks later asking for an update on my application, and I hear nothing back. I wait another week, it becomes a month and then eventually I find out that I have been ghosted. I thought it was very unprofessional and inconsiderate, especially because they had asked us to commit a lot of time to interview with them.

      Questions d'entretien [1]

      Question 1

      Tell me about a project that you are most proud of.
      Répondre à cette question
      1

      Entretien pour Software Engineering

      30 sept. 2016
      Candidat à l'entretien anonyme
      New York, NY
      Aucune offre
      Expérience positive
      Entretien moyen

      Candidature

      J'ai postulé en ligne. Le processus a pris 3 semaines. J'ai passé un entretien chez MathWorks (New York, NY)

      Entretien

      First, there was a basic phone screen interview asking about visa status, gpa, and basic behavioral question. After the phone screen you are asked to complete a hacker rank challenge and scheduled for a technical phone interview the following week. The hacker rank challenge questions were the following: 1. Given a List of Strings, return the words that can be typed only using one row of your keyboard. example: ["Hello", "Alaska", "Dad", "Peace"] => ["Alaska", "Dad"] 2. Given a List of Strings of operators and numbers, determine the sum of the given expression. The numbers can be positive or negative and the operators only have multiplication and division. 3. Given an array starting from 1 to 2^n, [1,2,3,4], transform the array such that when you split the array in half, the left side goes on top of the right, repeat this until the left side has a length of 1. [1,2,3,4] => [1,2][3,4] => [1][3][2][4] => [1,3,2,4]. 4. Given a graph of vertices and directed edges, return all vertices in order that can visit all other vertices within 2 steps. As for the technical interview, we went over how you would design a class of human and pets and was questioned about time complexity of the algorithm you wrote on HackerRank and more questions to problems regarding HackerRank Questions.

      Questions d'entretien [4]

      Question 1

      1. Given a List of Strings, return the words that can be typed only using one row of your keyboard. example: ["Hello", "Alaska", "Dad", "Peace"] => ["Alaska", "Dad"]
      1 réponse

      Question 2

      2. Given a List of Strings of operators and numbers, determine the sum of the given expression. The numbers can be positive or negative and the operators only have multiplication and division.
      1 réponse

      Question 3

      3. Given an array starting from 1 to 2^n, [1,2,3,4], transform the array such that when you split the array in half, the left side goes on top of the right, repeat this until the left side has a length of 1. [1,2,3,4] => [1,2][3,4] => [1][3][2][4] => [1,3,2,4].
      Répondre à cette question

      Question 4

      4. Given a graph of vertices and directed edges, return all vertices in order that can visit all other vertices within 2 steps.
      Répondre à cette question
      10