Ir para o conteúdoIr para a pasta
  • Vagas
  • Empresas
  • Salários
  • Para empresas

      Avance em sua carreira

      Descubra qual pode ser seu salário, conquiste a vaga dos seus sonhos e compartilhe insights de qualidade de vida com sigilo.

      employer cover photo
      employer logo
      employer logo

      Booking.com

      Parte da empresa Booking Holdings

      Empresa engajada

      Sobre
      Avaliações
      Remuneração e benefícios
      Vagas
      Entrevistas
      Entrevistas
      Buscas relacionadas: Avaliações da empresa Booking.com | Vagas da empresa Booking.com | Salários da empresa Booking.com | Benefícios da empresa Booking.com
      Entrevistas da empresa Booking.comEntrevistas do cargo de Software Developer - (Willing to Learn Perl) da empresa Booking.comEntrevista da empresa Booking.com


      Glassdoor

      • Sobre
      • Prêmios
      • Blog
      • Fale conosco

      Empresas

      • Conta gratuita de empresa
      • Área da empresa
      • Blog para empresas

      Informações

      • Ajuda
      • Regras da Comunidade
      • Termos de Uso
      • Privacidade e opções de anúncios
      • Não venda nem compartilhe minhas informações
      • Ferramenta de consentimento de uso de cookies

      Trabalhe conosco

      • Anunciantes
      • Carreiras
      Baixe o aplicativo:

      • Busque por:
      • Empresas
      • Vagas
      • Localizações

      Copyright © 2008-2026. Glassdoor LLC. “Glassdoor”, “Worklife Pro”, “Bowls” e o logotipo do Glassdoor são marcas comerciais pertencentes à Glassdoor LLC.

      Empresas seguidas

      Fique por dentro de todas as oportunidades e dicas internas seguindo as empresas de seus sonhos.

      Entrevista para Software Developer - (Willing to Learn Perl)

      25 de ago. de 2014
      Candidato(a) sigiloso(a) à entrevista
      Nenhuma oferta
      Experiência negativa

      Outras avaliações de entrevista de vagas de Software Developer - (Willing to Learn Perl) da empresa Booking.com

      Entrevista para Software Developer (Willing to Learn Perl)

      10 de jun. de 2015
      Funcionário(a) sigiloso(a)
      Amsterdã
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me por meio de recrutador(a). O processo levou 3 semanas. Fui entrevistado pela Booking.com em jun. de 2014

      Entrevista

      Everything has already been said on the other reviews, I'm writing this post to let you know my phone technical questions (we used TitanPad). The questions were harder than what I saw here on Glassdoor, but they did teel me that, considering my background, they were considering me for a Senior position, so maybe this explains why

      Perguntas de entrevista [3]

      Pergunta 1

      Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as: [ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ] ... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists) [ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ] (Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see: http://en.wikipedia.org/wiki/File:Monotonicity_example1.png
      3 respostas

      Pergunta 2

      Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e". Given this example input: [ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ] The output should be an array-of-arrays (or list-of-lists) [ ["pear","reap"], ["dirty room","dormitory"], ["amleth","hamlet"], ["tinsel","listen","silent"] ]
      3 respostas

      Pergunta 3

      Write a function get_hops_from(page1, page2) that will determine the number of hyperlinks that you would need to click on to get from some page1 on the web to some other page2 on the web. For example, if each page below links to the pages that are indented below it, e.g. page 1 links to pages 2 and 5, and page 2 links to pages 3 and 4, and page 5 links to pages 3 and 7, then the get_hops_from(page1, page7) should return 2 (2 hops), since you have to hop once from page 1 to 5 and once more from page 5 to page 7. page1 : distance == 0 page2 : distance == 1 page3 : distance == 2 page4 : distance == 2 page5 : distance == 2 page3 : distance == 2 page7 : distance == 2 Assume that an API is available to: * get_links(a_page) will return an array/list of all pages that a_page links to
      5 respostas
      10
      Oferta aceita
      Experiência positiva
      Entrevista difícil

      Candidatura

      Candidatei-me online. O processo levou 2 meses. Fui entrevistado pela Booking.com (Amsterdã) em fev. de 2015

      Entrevista

      Never had such before. Instead of just giving a task (as an exam) and wait you cracking it they told about a problem and we were working on it together. The whole process included: -coding task on time online. -mobile short talk to HR -online technical interview with 2 team leads -onsite interview. 5 hours, 3 rounds.

      Perguntas de entrevista [1]

      Pergunta 1

      The chess game and algorithm for a horse getting shortest path to move from one point to another.
      1 resposta
      2

      Entrevista para Perl Developer (Willing to Learn Perl)

      12 de jan. de 2015
      Candidato(a) sigiloso(a) à entrevista
      Nenhuma oferta
      Experiência positiva
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me por indicação de um funcionário. O processo levou 4 semanas. Fui entrevistado pela Booking.com em jan. de 2015

      Entrevista

      After I applied this position, got an Email and need to finish online code test on HackerRank. The test contains 6 coding tests with 3 difficult, 2 medium and 1 easy problem( Just choose the one you can complete in 1 hour) . Then I got call from HR and confirmed the time of technical review. Then, the technical phone review with two developer. The question is there is an endless stream, you can get characters from this stream one by one. How to identify a word from this stream? How to handle the case if the first character of this word appeared several times in this word? For example, grep "interview" from "intervinterview". How to find thousands of word from this string?

      Perguntas de entrevista [1]

      Pergunta 1

      As above
      Responder à pergunta
      3

      Entrevista para Software Developer Willing to Learn Perl

      3 de jan. de 2016
      Candidato(a) sigiloso(a) à entrevista
      Amsterdã
      Nenhuma oferta
      Experiência positiva
      Entrevista difícil

      Candidatura

      Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Booking.com (Amsterdã) em dez. de 2014

      Entrevista

      * Recruitment Interview with the Recruiter : This was general round over telephone, recruiter asked me some general questions about my total experience, why do I want to leave my current company and why do I want to join booking.com * Technical phone interview with 2 members from the IT Department : In this round first I got a test fr 1 hour and that test was prepared by Hackerrank.com, after that I got a call and phone interview starts, during phone interview they again gave me a problem to write algorithm for it and asked complexity of it. * Face to face interview at office, in my case Amsterdam

      Perguntas de entrevista [1]

      Pergunta 1

      If there is a small hotel in part of Amsterdam why should we add them?
      1 resposta

      Buscas de vagas

      Comece a buscar vagas para receber atualizações e recomendações personalizadas.