Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela MSCI (Pune) em jul. de 2025
Entrevista
The interview process began with an Online Assessment (OA) consisting of two DSA questions and one SQL query. The DSA questions ranged from easy to medium difficulty, while the SQL question was quite challenging. After clearing the OA, I appeared for two technical interview rounds where I was asked to solve coding problems, explain my project work, and demonstrate my understanding of core concepts. The final round was focusing on problem-solving approach, real-life scenarios, and behavioral questions.
Perguntas de entrevista [1]
Pergunta 1
Detect if a cycle exists in a linked list and return the node where the cycle begins.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela MSCI em ago. de 2024
Entrevista
Date of interview at MSCI was 6/08/2024.
It was an on-campus opportunity I had an online test where two coding questions were easy-moderate and one SQL question. In my Interview, there were three rounds in total, the first two of which were technical and the last one being an HR round. In the Technical round, there were questions related to OOPS, DBMS and OS and a coding question(DSA). In my Second round, I had to answer some questions related to my project and the technologies used in them. Third round was behavioural. they asked general HR questions.
Perguntas de entrevista [1]
Pergunta 1
They give me a table and told me to normalise it.
Also after normalisation, they told me to write a basic SQL query to fetch data from multiple tables.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela MSCI (Bengaluru) em ago. de 2023
Entrevista
It is divided into 2 phase 1: online assignment 2: 2 tecnical + 1HR interview Ask about DSA questions on linklist , tree, one puzzle, ans discuss about projects in resume
Perguntas de entrevista [1]
Pergunta 1
Loop in linklist , size of loop , iterative tree traversal
