Sprinklr Interview Experience for Product Engineer 2023

The Recruitment Process consists of:

1. Online Coding Round
2. Technical Round 1
3. Technical Round 2
4. Bar Raiser Round
5. Fitment/HR Round

Each and Every Round was eliminatory.

Round 1 (Online coding test, Platform: HackerEarth): Total 3 Questions. Those who solved at least 2 Questions out of 3 were shortlisted for interviews.

Q1. (Easy: 50 points): Based on the two-pointers. I don’t remember the Question. But it was very Easy. Almost everyone in my batch solved this Question.

Q2. (Medium: 75 points): You are given a connected undirected graph. It has n nodes and m edges. Each node has some sweetness value that will be given to us. The game is as follows:

1. Alice moves first and she may break a node. Each edge connected to this node will vanish.
2. Bob will pick any connected component(containing all or some nodes)
3. Alice will pick any remaining connected components if there are any

The game ends in three steps. Both of them want to maximize their score by collecting the maximum possible sweetness. They are not trying to minimize each other’ score.

Determine the maximum score of Alice and Bob respectively. Assume both play the game optimally.

Graph nodes index starts from 1. If no connected component left, Alice gets 0.

Q3. (Hard: 100 points): This question was similar to this question – https://leetcode.com/problems/cinema-seat-allocation/

Verdict: 82 students were shortlisted out of a batch size of 400.

Technical Round 1 (Online Interview, Platform: Microsoft Teams): The interview lasted for almost an hour. He was very friendly. In the beginning, he introduced himself followed by a quick introduction from my side. Then he asked about my hobbies and what I do apart from coding and stuff.

Then he dive into my resume and asked me to explain my projects in detail. We had a detailed discussion on projects.

After that, he asked me a coding question that you have been given this binary tree. You have to design an API to use as an API you have to convert into a string. breaking it down it was to convert binary tree to string. I was told to code it and tell the time complexity of the code.

https://leetcode.com/problems/construct-string-from-binary-tree/

Another question was: https://leetcode.com/problems/keys-and-rooms/ (similar to that)

Verdict: 24 students were shortlisted out of 82 (Selected).

Technical Round 2 (Online Interview, Platform: Microsoft Teams): The interviewer introduced himself followed by a quick introduction from my side.

He directly jumped into the coding question: The question was similar to like this https://leetcode.com/problems/course-schedule/

We discussed heavily on this question he was giving follow-up questions on this question. (I can’t explain him properly the approach)

Verdict: 12 students were shortlisted out of 24 (Rejected).

Final Verdict: Rejected.