Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en Sprinklr (Hyderabad) en ago 2022
Entrevista
Question asked was LC Hard. It was to find max path sum in a binary tree. The interviewer was not giving enough hints and was stuck around giving modifications to the code.
Me postulé a través de una facultad o universidad. Acudí a una entrevista en Sprinklr (Nueva Delhi)
Entrevista
First, there was an online assessment containing 3 questions, followed by 3 rounds of interviews and one HR round. The first round was completely DSA (I got rejected in this only😅), followed by 2 rounds of DSA and computer fundamentals, including OOPS, DBMS, OS and Design,
Preguntas de entrevista [1]
Pregunta 1
It was similar to a LIS question, but the length was fixed of size 3. I wanted to return the array of those elements provided the value of the elements was minimum. The values were given in a different array.
Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Sprinklr (Gurgaon, Haryana) en ago 2023
Entrevista
The first round was a technical round in which two DSA questions were asked. The interview was taken on google docs and the questions were fairly straightforward. The interviewer was friendly and helpful. The second round was also technical but the interviewer was very harsh. He presented a hard DSA question but did not allow for any hints. He asked some follow up questions which were answered correctly but he was not satisfied.
Preguntas de entrevista [1]
Pregunta 1
A question about randomizing lists, a question about breadth first search, questions about time complexities.
Me postulé a través de una facultad o universidad. El proceso tomó 1 día. Acudí a una entrevista en Sprinklr (Vāranāsi) en jul 2023
Entrevista
he interview started with a brief introduction. I was asked to introduce myself, so I shared my educational background, key projects I’ve worked on, and some of my technical skills. After this, the interviewer shared a Google Doc and explained that we would proceed with problem-solving questions.
The first question was a puzzle about finding the 3 fastest horses. I understood the problem well and was able to solve it. The interviewer seemed satisfied with my approach and the clarity of my explanation.
The second question was a DSA problem, specifically implementing a Min Stack. At the time, I struggled to fully understand the problem statement, and unfortunately, I couldn’t solve it during the interview. I asked clarifying questions but still found it challenging to get to a solution in the given time.
