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

      Veeva Systems

      Questa è la tua azienda?

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Veeva Systems | Offerte di lavoro di Veeva Systems | Stipendi di Veeva Systems | Benefit di Veeva Systems
      Colloqui di Veeva SystemsColloqui per Software Application Developer presso Veeva SystemsColloquio di Veeva Systems


      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
      BMW Group
      4.0★Stipendio e benefit
      avatar
      Sinch
      3.7★Stipendio e benefit
      avatar
      Anton Tech
      3.6★Stipendio e benefit

      Colloquio per Software Application Developer

      1 nov 2019
      Candidato anonimo a colloquio
      Toronto, ON
      Nessuna offerta
      Esperienza neutra
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura di persona. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Veeva Systems (Toronto, ON) nel mese di ott 2019

      Colloquio

      1st Phone Interview: Basic background and resumé questions. 2nd Coding challenge: I was given two business days to delivery a basic Java challenge. 3rd Onsite Interview: The on site interview was a bit hard but they said that it was better because it only consumes a day, but it was a five part interview, very tiring. All the interviewers were really nice, despite the fact that some of then were too much of a serious. The first interview was really straight foward, the interviewer just wanted to know about my experience and talked a little about the company systems. The second was a little to hard. I had to do a challenge about mapping. It was hard because was acctualy my first experience with this kind of interview. In the end, I couldn't finish it and all the time I felt the dissapointment of the interviewer. That kind of blowed the rest of the process. The third interview was more about the company. The interviewer talked a lot about the culture and the products, and said that he wanted to know what I could say about me that fitted their culture. Sounded more of a behavioral interview. The fourth was again another challenge but in Java. I had to implement the HashMap data structure using basic data structures. It was kind of hard because of the time. The last interview was with the first person that I talked on the phone. It was more like a formal interview about the company, shw talked more about it's products and culture, asked me about some questions of how could I see myself in the company. The total process took around five and a half hours.

      Domande di colloquio [2]

      Domanda 1

      How would you implement Java HashMap with basic data structures?
      Rispondi alla domanda

      Domanda 2

      How could I find the common Node of two simple linked lists with the minimum complexity?
      Rispondi alla domanda
      3