Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso 91mobiles (Gurgaon, Haryana) nel mese di feb 2014
Colloquio
Campus Placement - 1 Written Exam followed by stress interview. Selected students were called to their campus where next 3 rounds of interview taken but all very friendly interviews focused on your interest.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso 91mobiles (Gurgaon, Haryana) nel mese di dic 2022
Colloquio
first round was a aptitude and general computer knowledge test
the second round was a technical round which was a pen-paper round and
the third round was a personal interview in which they asked about my project
Domande di colloquio [1]
Domanda 1
PHP, Javascript, SQL, data structure and algorithms
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso 91mobiles
Colloquio
Interview was in 3 rounds, 1st - a written test with few logical and reasoning problems to solve, 2nd - a technical round, with programming questions on arrays, strings, 3rd - another technical round consist of a little more difficult questions on queue, stack and logical puzzles.
Domande di colloquio [1]
Domanda 1
Reverse an array, Palindrome, merge array, implement queue/stack, circular queue etc.
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso 91mobiles (Gurgaon, Haryana) nel mese di feb 2014
Colloquio
Campus Selection: 90 min online test consisting of five sections(2 technical + 1 verbal + 1 aptitude + 1 Logical Reasoning) followed by 2 technical + puzzles round then final HR round.Initially shortlisted 21 students for technical round of interviews based on the performance in the online test .
Domande di colloquio [1]
Domanda 1
Coding questions:1.Basics of synchronization , test and set, locks, mutex
2.Given a binary tree , and two values a and b, find the shortest length between the nodes with info a and b.
3.Convert a BST to a sorted circular doubly-linked list in-place.
Puzzles asked: Generalized egg problem + 25 horses problem.