Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      Nexmo

      Acquisita da Vonage

      Questa è la tua azienda?

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Nexmo | Offerte di lavoro di Nexmo | Stipendi di Nexmo | Benefit di Nexmo
      Colloqui di NexmoColloqui per Test Automation Engineer presso NexmoColloquio di Nexmo


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Le migliori aziende per "stipendio e benefit" vicino a te

      avatar
      Orange
      3.7★Stipendio e benefit
      avatar
      Huawei Technologies
      3.6★Stipendio e benefit
      avatar
      Ericsson
      3.6★Stipendio e benefit
      avatar
      SIB Systems
      5.0★Stipendio e benefit

      Colloquio per Test Automation Engineer

      18 lug 2018
      Candidato anonimo a colloquio
      Londra, Inghilterra
      Nessuna offerta
      Esperienza negativa
      Colloquio nella media

      Candidatura

      La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Nexmo (Londra, Inghilterra) nel mese di lug 2018

      Colloquio

      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.

      Domande di colloquio [12]

      Domanda 1

      Given the number return largest possible number with same digits
      1 risposta

      Domanda 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 risposta

      Domanda 3

      How can you check that number is odd.
      1 risposta

      Domanda 4

      Given algorithm what is it's O complexity
      1 risposta

      Domanda 5

      Which of the following algorithms return shortest path in the graph
      1 risposta

      Domanda 6

      What data structure is usually used for databases
      1 risposta

      Domanda 7

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

      Domanda 8

      You have 1000 elements which of the following is largest.
      2 risposte

      Domanda 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 risposta

      Domanda 10

      How long would take to calculate sums of each pair of elements in array
      1 risposta

      Domanda 11

      What is the lowest number of comparisons to find smallest number out of 5
      1 risposta

      Domanda 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 risposta
      5