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

      LessThan3

      Essa empresa é sua?

      Sobre
      Avaliações
      Remuneração e benefícios
      Vagas
      Entrevistas
      Entrevistas
      Buscas relacionadas: Avaliações da empresa LessThan3 | Vagas da empresa LessThan3 | Salários da empresa LessThan3 | Benefícios da empresa LessThan3
      Entrevistas da empresa LessThan3Entrevistas do cargo de Junior Full Stack Developer da empresa LessThan3Entrevista da empresa LessThan3


      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.

      As melhores empresas na categoria “Remuneração e benefícios” perto de você

      avatar
      Deloitte
      3.5★Remuneração e benefícios
      avatar
      KPMG
      3.6★Remuneração e benefícios
      avatar
      bp
      3.9★Remuneração e benefícios
      avatar
      SLB
      3.9★Remuneração e benefícios

      Buscas de vagas

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

      Entrevista para Junior Full Stack Developer

      30 de ago. de 2023
      Candidato(a) sigiloso(a) à entrevista
      Calgary, AB
      Nenhuma oferta
      Experiência negativa
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela LessThan3 (Calgary, AB) em jul. de 2023

      Entrevista

      First interview: Behavioural questions: Tell us about yourself Why do you want to work here? What is your 5 year plan? How did you handle conflict with a co-worker? General technical knowledge: An example of a design pattern and its use operators used in different languages Database (de)normalization primary/foreign keys Word relationships: Given three words, find the word or concept that is related to all of them - Ex: Given "Barn, Back, Court", the answer is "Yard" - Ex: Given "Dime, Pluto, Rhode Island", the answer is "Smallest of their respective set" Problem-Solving Question: You are given two magical eggs and need to determine at what floor they'll break at when dropped from one of the floors of a 100-storey building. When the egg lands it will either break and you can no longer use it, or it will not break and you can continue to use it. Start with the most inefficient, then describe the most efficient strategies to determine the worst-case number of drops required to determine what floor the eggs will break at. - Most inefficient case: Start from the bottom and work your work to the top. Answer: 100 drops. - Better: Binary search - drop one egg from floor 50, then work your way up or down (depending on the result). Answer: 50 drops - 1 at floor 50 and 49 to test with second egg. - Best: Drop first egg every 10 floors. In the worst case, it will break on floor 100, so you need to test second egg between floor 91 and 99. Answer: 19 drops. - Optimal: 14 drops, though I'm not sure how to get this answer. Second interview: 25-minute paper-based IQ test - Given 3 shapes in a pattern, what's the next shape in the pattern? - Given two shapes, what shapes are most analogous but with a different meaning? 25-minute whiteboard interview - Design an algorithm to shift items in an array k spaces to the right 5-minute review of your resume - Why do you want to work at LessThan3? 5-minute chance to ask them questions After the second interview, they said they'd pick their candidate and respond to all interviewees with the results. They never got back to me.

      Perguntas de entrevista [4]

      Pergunta 1

      General technical questions: An example of a design pattern and its use operators used in different languages Database (de)normalization primary/foreign keys
      Responder à pergunta

      Pergunta 2

      Word relationships: Given three words, find the word or concept that is related to all of them - Ex: Given "Barn, Back, Court", the answer is "Yard" - Ex: Given "Dime, Pluto, Rhode Island", the answer is "Smallest of their respective set"
      Responder à pergunta

      Pergunta 3

      Problem-Solving Question: You are given two magical eggs and need to determine at what floor they'll break at when dropped from one of the floors of a 100-storey building. When the egg lands it will either break and you can no longer use it, or it will not break and you can continue to use it. Start with the most inefficient, then describe the most efficient strategies to determine the worst-case number of drops required to determine what floor the eggs will break at. - Most inefficient case: Start from the bottom and work your work to the top. Answer: 100 drops. - Better: Binary search - drop one egg from floor 50, then work your way up or down (depending on the result). Answer: 50 drops - 1 at floor 50 and 49 to test with second egg. - Best: Drop first egg every 10 floors. In the worst case, it will break on floor 100, so you need to test second egg between floor 91 and 99. Answer: 19 drops. - Optimal: 14 drops, though I'm not sure how to get this answer.
      Responder à pergunta

      Pergunta 4

      Design an algorithm to shift items in an array k spaces to the right
      Responder à pergunta