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

      MongoDB

      Azienda coinvolta

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su MongoDB | Offerte di lavoro di MongoDB | Stipendi di MongoDB | Benefit di MongoDB
      Colloqui di MongoDBColloqui per Associate Consulting Engineer, Remote Services presso MongoDBColloquio di MongoDB


      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 Associate Consulting Engineer, Remote Services

      11 mag 2020
      Dipendente anonimo
      Gurgaon, Haryana
      Offerta accettata
      Esperienza positiva
      Colloquio difficile

      Candidatura

      Ho sostenuto un colloquio presso MongoDB (Gurgaon, Haryana) nel mese di feb 2020

      Colloquio

      The interview process was designed to evaluate the in-depth knowledge along with the communication skills that we have. The most initial step to get yourself an onsite interview call is to clear the telephonic interview. The telephonic interview emphasise mainly on your ability to respond to basic HR questions along with subject knowledge(Java, Data Structures etc.). Then, the onsite interview has five rounds: 1. Group Discussion (8-10 students in a go with a current affair/Technical/Non-Technical topic) 2. Coding Round (2 questions based on Data Structures and Algorithm, that is, lists, tress, graphs, strings, arrays etc in any programming language you are comfortable with) 3. Technical Round 1 (This was basically an in-depth discussion over your codes that you wrote in the previous round along with questions related to it) 4. Technical Round 2 (In-depth questions related to all the technical domains that you can expect including data structures, operating systems, computer networks, java, databases, joins and sql queries etc.) 5. Manager Round(I gave a small presentation of a mongoDB feature that I was asked to prepare for, this might differ for you) Finally, we had a final virtual interview with the Vice President of the Global team and then the final confirmation from the company that I got selected. The whole process was very well managed and all the candidates were well informed and equipped with all the baisc information one needs to know before getting into the process, so you don’t have to worry about a lot of things, since the team tries to make the whole process more transparent and distinct. Additionally, you all will be treated with free snacks throughout the day during the process.

      Domande di colloquio [2]

      Domanda 1

      Longest Common Subsequence optimised solution.
      Rispondi alla domanda

      Domanda 2

      Longest common substring along with largest number of string occurrence in the two given strings, optimised solution.
      Rispondi alla domanda
      1