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

      Report Garden

      Essa empresa é sua?

      Sobre
      Avaliações
      Remuneração e benefícios
      Vagas
      Entrevistas
      Entrevistas
      Buscas relacionadas: Avaliações da empresa Report Garden | Vagas da empresa Report Garden | Salários da empresa Report Garden | Benefícios da empresa Report Garden
      Entrevistas da empresa Report GardenEntrevistas do cargo de Full Stack Developer da empresa Report GardenEntrevista da empresa Report Garden


      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. Indeed, Inc. “Glassdoor”, “Worklife Pro”, “Bowls” e o logotipo do Glassdoor são marcas comerciais pertencentes à Indeed, Inc.

      Empresas seguidas

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

      Buscas de vagas

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

      Entrevista para Full Stack Developer

      6 de ago. de 2016
      Candidato(a) sigiloso(a) à entrevista
      Hyderābād

      Outras avaliações de entrevista de vagas de Full Stack Developer da empresa Report Garden

      Entrevista para Full Stack Developer

      1 de out. de 2016
      Candidato(a) sigiloso(a) à entrevista
      Hyderābād
      Nenhuma oferta
      Nenhuma oferta
      Experiência neutra
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Report Garden (Hyderābād) em jul. de 2016

      Entrevista

      I applied through their site. Got a basic phone call from the recruiter where I was told about the role and was asked about my current experience and role. Got a basic phone screening with some questions on my project and RESTful API architecture as I had mentioned them in my resume. Then I was sent a programming assignment which was a path finding problem and any programming language can be used. I solved the problem and sent them a solution. Got a call from my manager to discuss on the role, culture and expectations from the company. A face to face interview was scheduled wherein I was told that there will be a computer with internet connection and they will teach me new technology to learn how I adapt to them. The face to face interview started with a series of algorithmic questions for which I was not prepared and got stressed out and I was let go by the recruiter and my travel expenses were reimbursed. I solved all of them on my way back. The recruiter could have told me if I need to prepare for the algorithmic round for which I got a no from the recruiter. The problems were from geeksforgeeks site which mostly involved array manipulation and calculation of subsets of an array passing a certain condition. All the best!

      Perguntas de entrevista [1]

      Pergunta 1

      Home assignment : A path finding problem to find the word on a grid of letters with certain conditions. Face to face round : Subset sum with sum closest to zero. Subset of array to be sorted for the whole array to be sorted. Subset sum problem.
      Responder à pergunta
      4
      Experiência positiva
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me online. O processo levou 1 dia. Fui entrevistado pela Report Garden (Hyderābād) em ago. de 2016

      Entrevista

      Applied in their website. Got a call from HR. Had a telephonic interview. Asked about projects, basic questions about time complexities. Given a array containing numbers from 1 to n, one number is missing, one number is repeating. Gave the answer in O(nlogN), satisfied. Next day, HR called me and sent a coding challeneg. Did that, later got an invitation for F2F in their office. First round is went fine. Later they gave me a problem of File Systems, didn't do it. All expenses reimbursed. Later got call from the person who interviewed me in the first round, asking my expected package, said 7.5, he said can't give that much, I said 7, there is no response from their side. But, overall I like their culture all are from BITS (everyone speaks telugu). Special Mention, Ashwin who interview me in F2F, he is a cool guy, I didn't felt it's an interview, a typical geek discussion. He helped me so much.

      Perguntas de entrevista [1]

      Pergunta 1

      Telephonic: Given a array containing numbers from 1 to n, one number is missing, one number is repeating. Gave the answer in O(nlogN) Coding Challenge: You will be given a matrix m*n and a word you have to find the occurrences of that word in the neighbourhood with some conditions. A basic dynamic programming problem of medium difficulty. F2F 1st Round: 1. You will be given an array, find the sub-array indexes which if you sort it the whole array would be sorted. 2. You will be given an array, find the pairs of numbers whose sum is closest to zero 3. You are designing a game, where some letters were pre-defined and hidden, when user says 'a', if that is in that list, it will be displayed. Write an algorithm to check if any offensive word can be found from that list. Function definition would be like, findOffensive(String mainString, String offensive) F2F 2nd Round: You will be given a binary file which contain the data about file system, you have to tell whether the given path is valid or not.
      Responder à pergunta
      2