Aller au contenuAller au pied de page
  • Emplois
  • Entreprises
  • Salaires
  • Pour les employeurs

      Boostez votre carrière

      Découvrez votre salaire potentiel, décrochez des emplois de rêve et partagez vos témoignages de manière anonyme.

      employer cover photo
      employer logo
      employer logo

      Report Garden

      Est-ce votre entreprise ?

      À propos
      Avis
      Salaires et avantages
      Emplois
      Entretiens
      Entretiens
      Recherches associées: Avis sur Report Garden | Offres d’emploi chez Report Garden | Salaires chez Report Garden | Avantages sociaux chez Report Garden
      Entretiens chez Report GardenEntretiens d’embauche pour Full Stack Developer chez Report GardenEntretien chez Report Garden


      Glassdoor

      • À propos
      • Récompenses
      • Blog
      • Nous contacter
      • Guides

      Employeurs

      • Compte employeur gratuit
      • Centre employeur
      • Blog pour les employeurs

      Informations

      • Aide
      • Règles de la communauté
      • Conditions d'utilisation
      • Confidentialité et choix publicitaires
      • Ne pas vendre ni partager mes informations
      • Outil de consentement aux cookies

      Travailler avec nous

      • Annonceurs
      • Carrières
      Télécharger l'application

      • Parcourir par :
      • Entreprises
      • Emplois
      • Lieux

      Copyright © 2008-2026. Glassdoor LLC. « Glassdoor », son logo, « Worklife Pro » et « Bowls » sont des marques déposées de Glassdoor LLC.

      Entreprises suivies

      Tenez-vous au courant des dernières opportunités et profitez de conseils d’initiés en suivant les entreprises de vos rêves.

      Recherche d’emplois

      Obtenez des recommandations et des mises à jour personnalisées en démarrant vos recherches.

      Entretien pour Full Stack Developer

      6 août 2016
      Candidat à l'entretien anonyme
      Hyderâbâd
      Aucune offre
      Expérience neutre
      Entretien moyen

      Candidature

      J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez Report Garden (Hyderâbâd) en juil. 2016

      Entretien

      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!

      Questions d'entretien [1]

      Question 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.
      Répondre à cette question
      4

      Autres retours d’entretien d’embauche pour un poste comme Full Stack Developer chez Report Garden

      Entretien pour Full Stack Developer

      1 oct. 2016
      Candidat à l'entretien anonyme
      Hyderâbâd
      Aucune offre
      Expérience positive
      Entretien moyen

      Candidature

      J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Report Garden (Hyderâbâd) en août 2016

      Entretien

      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.

      Questions d'entretien [1]

      Question 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.
      Répondre à cette question
      2