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

      Nexmo

      Acquis par Vonage

      Est-ce votre entreprise ?

      À propos
      Avis
      Salaires et avantages
      Emplois
      Entretiens
      Entretiens
      Recherches associées: Avis sur Nexmo | Offres d’emploi chez Nexmo | Salaires chez Nexmo | Avantages sociaux chez Nexmo
      Entretiens chez NexmoEntretiens d’embauche pour Test Automation Engineer chez NexmoEntretien chez Nexmo


      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 Test Automation Engineer

      18 juill. 2018
      Candidat à l'entretien anonyme
      Londres, Angleterre
      Aucune offre
      Expérience négative
      Entretien moyen

      Candidature

      Le processus a pris 1 semaine. J'ai passé un entretien chez Nexmo (Londres, Angleterre) en juill. 2018

      Entretien

      Got contacted contacted by Talent Acquisition team via LinkedIn. First had phone interview with one of the member of this team, then I was asked to do online Codility task (preferably by the end of the week - I did it next day. I had 175 minutes for this test task (there were 2 programming tasks and then set of questions). First thing these questions were highly unusual for tester role, I didn't mind the difficulty as I've studied it all at uni, but they were more around algorithms, complexity and more obscure things that I've never encountered in Testing. I did it all in about one hour so I wouldn't consider it end of the world, but if you've never studied this, I can imagine most people must be pretty lost. I've let them know after finishing this task that I've submitted my solution (mostly as confirmation, I'm pretty sure they get notification from the testing platform). And then I've waited for almost a week. After a week I asked for feedback and was asked for my availability for a call next day. As I've tried to arrange this, I've never heard from them again and got ghosted as some other candidates mentioned here. All in all don't waste your time, it's really not worth it. Your time is more precious than that. I enjoyed the online assessment as it brought back memories from uni, but could live without the rest of the experience.

      Questions d'entretien [12]

      Question 1

      Given the number return largest possible number with same digits
      1 réponse

      Question 2

      Given number find count of similar numbers - similar numbers are numbers which got same digits, but in different order. This has to be done within logarithmic complexity (O(log n)).
      1 réponse

      Question 3

      How can you check that number is odd.
      1 réponse

      Question 4

      Given algorithm what is it's O complexity
      1 réponse

      Question 5

      Which of the following algorithms return shortest path in the graph
      1 réponse

      Question 6

      What data structure is usually used for databases
      1 réponse

      Question 7

      You have tree with 4 nodes, how many edges do you have to add so it's not tree anymore
      1 réponse

      Question 8

      You have 1000 elements which of the following is largest.
      2 réponse(s)

      Question 9

      Don't remember exact wording, but given current computers, if something take certain number of operations, how long it's going to take to finish
      1 réponse

      Question 10

      How long would take to calculate sums of each pair of elements in array
      1 réponse

      Question 11

      What is the lowest number of comparisons to find smallest number out of 5
      1 réponse

      Question 12

      Having array of numbers. Iterating once over it, you compare two elements next to each other, and you swap them if element on the right is smaller than element on the left. What is true about the array at the end.
      1 réponse
      5