I had 3 challenging Data Structures and Algorithms questions in the online assessments on some platform, solvable in any programming language. I had chosen Python as my preferred language for implementation.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez InMobi (Bengaluru)
Entretien
There were 4 rounds-3 technical and 1 HR.
In the 1st technical round, I was asked 3 easy-medium DSA questions. The topics were arrays, linked lists and binary trees.
In the 2nd technical round, I was asked 5-6 DSA questions. The topics were arrays, linked lists, trees. The difficulty was easy to hard. Apart from DSA, I was asked about normalisation in DBMS
Questions d'entretien [1]
Question 1
Write a program to rotate a linked list from a position.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez InMobi (Lucknow) en sept. 2025
Entretien
R1 was coding online assessment on Doselect platform with 3 questions medium to hard
R2 was dsa interview Hard Leetcode questions Russian doll envolpe
R3 was again dsa interview with hard question 847. Shortest Path Visiting All Nodes
R4 was HM round based on resume and projects
R5 was hr round
Questions d'entretien [1]
Question 1
Russian doll envolpe leetcode
847. Shortest Path Visiting All nodes
