Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Mobikwik
Colloquio
First-round was of 350 marks out of which objective questions are of 150 marks and a coding round of 200 marks containing 3 coding questions(50+50+100 marks), followed by 3 technical interview rounds and 1 HR round.
In 2 hours, objective questions from DBMS, Data structure, Algorithm, C/C++/JAVA/SQL queries and 3 coding questions of different difficulty levels have to be solved. Two of them were of easy level and the last one was of middle-level coding.
Domande di colloquio [1]
Domanda 1
In climbing a round pole of 80 meters height, a monkey climbs 5 meters in a minute and slips 2 meters in the alternate minute. How much time would the monkey take to get to the top of the pole?
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Mobikwik (Nuova Delhi) nel mese di nov 2019
Colloquio
On-campus experience: First there was cgpa cutoff of 6.5 to apply for the company. Then there was a screening coding test which was done online. After clearing the online test, there were 2 coding interviews followed by an hr interview.
Domande di colloquio [1]
Domanda 1
I was asked questions related to linked lists and trees. The first question was about the benefits and problems associated with linked lists. Then I was asked how linked lists can be used to store a tree like data structure. Then I was asked follow up questions on its traversal and other different scenarios where the tree was structured in a different way.
Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Mobikwik (Gurgaon, Haryana) nel mese di ott 2019
Colloquio
I applied online and got interview call in October 2019, i got interview venue details from hr persons
first written technical round containing 2 coding questions and around 15 objective type questions, followed by face to face interview
there were some standard questions from Geeksforgeeks.
Domande di colloquio [2]
Domanda 1
Find next greatest number in array( use stack or recursion)
