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

      Google

      Azienda coinvolta

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Google | Offerte di lavoro di Google | Stipendi di Google | Benefit di Google
      Colloqui di GoogleColloqui per Software Engineer presso GoogleColloquio di Google


      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.

      Colloquio per Software Engineer

      25 gen 2011
      Candidato anonimo a colloquio
      New York, NY
      Nessuna offerta
      Esperienza positiva
      Colloquio nella media

      Candidatura

      La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google (New York, NY) nel mese di nov 2010

      Colloquio

      * Write iterator class encapsulating in-order traversal of a binary tree. What is a time complexity? What is a worst case? * You have a collection of html documents grouped by a source web site . You need to count frequencies of bi-grams across all documents and present it in a sorted order (may be return top N frequent bi-grams). How would you approach it? How to filter out non-significant bi-grams? How to distribute and merge? What data structures to use to keep counters? * OOP. Write classes representing expression tree for a simple calculator. You care only about constants and basic binary operators. Write function evaluating expressions. * N clients - M servers. Each server can handle limited number of queries/sec. How to improve availability and performance ? * Write code to shift a string with rotation [a, b, c << 2 = 2 c, a, b] * How to count frequencies of characters in a string. What if the string is too huge? When is it reasonable to distribute across machines? How to find the most frequent character in the distributed scenario with a minimum data exchange between machines? * You are given a huge stream of geo coordinates. Unordered. Return list of objects in a specified radius from some point X.

      Domande di colloquio [1]

      Domanda 1

      Count bi-grams in a huge collection of documents grouped by source web site.
      1 risposta
      1

      Altre recensioni di colloqui per Software Engineer presso Google

      Colloquio per Software Engineer

      4 mag 2014
      Dipendente anonimo
      Auburndale, FL
      Offerta accettata
      Esperienza positiva
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Google (Auburndale, FL) nel mese di apr 2014

      Colloquio

      Direct onsite because I interviewed in the past and did well that time. From the time I sent my resume to interview day: 2 weeks. From interview day to offer over the phone: 2 weeks. The syllabus for the interviews is very clear and simple: 1) Dynamic Programming 2) Super recursion (permutation, combination,...2^n, m^n, n!...etc. type of program. (NP hard, NP programs) 3) Probability related programs 4) Graphs: BFS/DFS are usually enough 5) All basic data structures from Arrays/Lists to circular queues, BSTs, Hash tables, B-Trees, and Red-Black trees, and all basic algorithms like sorting, binary search, median,... 6) Problem solving ability at a level similar to TopCoder Division 1, 250 points. If you can consistently solve these, then you are almost sure to get in with 2-weeks brush up. 7) Review all old interview questions in Glassdoor to get a feel. If you can solve 95% of them at home (including coding them up quickly and testing them out in a debugger + editor setup), you are in good shape. 8) Practice coding--write often and write a lot. If you can think of a solution, you should be able to code it easily...without much thought. 9) Very good to have for design interview: distributed systems knowledge and practical experience. 10) Good understanding of basic discrete math, computer architecture, basic math. 11) Coursera courses and assignments give a lot of what you need to know. 12) Note that all the above except the first 2 are useful in "real life" programming too! Interview 1: Graph related question and super recursion Interview 2: Design discussion involving a distributed system with writes/reads going on at different sites in parallel. Interview 3: Array and Tree related questions Interview 4: Designing a simple class to do something. Not hard, but not easy either. You need to know basic data structures very well to consider different designs and trade-offs. Interview 5: Dynamic programming, Computer architecture and low level perf. enhancement question which requires knowledge of Trees, binary search, etc. At the end, I wasn't tired and rather enjoyed the discussions. I think the key was long term preparation and time spent doing topcoder for several years (on and off as I enjoy solving the problems). Conclusion: "It's not the best who win the race; it's the best prepared who win it."
      2501

      Colloquio per Software Engineer

      7 giu 2026
      Candidato anonimo a colloquio
      Los Altos, CA
      Nessuna offerta
      Esperienza neutra
      Colloquio difficile

      Candidatura

      Ho sostenuto un colloquio presso Google (Los Altos, CA)

      Colloquio

      Went with an OA which was pretty easy. Then got to second round (1 coding and 1 behavioral). Both were pretty straight forward. Then got to the onsite. They asked me leetcode hard questions. I was able to do well in one but failed the other one.

      Domande di colloquio [1]

      Domanda 1

      Why do you want to work at Google?
      Rispondi alla domanda

      Colloquio per Software Engineer

      7 giu 2026
      Dipendente anonimo
      Seabrook, NH
      Offerta accettata
      Esperienza positiva
      Colloquio facile

      Candidatura

      Ho sostenuto un colloquio presso Google (Seabrook, NH)

      Colloquio

      Had a good interview. Easy problems not leetcode but if you know how to solve problems and use which DSA to use for what problem then you are good.. system design as well.

      Domande di colloquio [1]

      Domanda 1

      Tell me about yourself ?
      Rispondi alla domanda

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

      avatar
      Amazon
      3.7★Stipendio e benefit
      avatar
      HENNGE
      3.8★Stipendio e benefit
      avatar
      xneelo
      3.8★Stipendio e benefit