Company: Sprinklr
Job Profile: Product Intern (2 Months)
Compensation: 1.5L pm
College: Tier 1.5
Opportunity: On-campus, open for all

OA

There were two questions one was easy-medium binary search question and the other was a hard graph question. I was able to solve both of them and a total of 30 students were shortlisted from our campus.

Round 1

The round started with a basic introduction, I had some work experience so the interviewer discussed that with me. A few questions were -

1. How do you manage API Calls?
2. Is http.post and http.get scalable?

Then we moved to a DSA question, the interview was held on an online notepad with screen sharing enabled.

The question was an easy sliding window based question, there were a couple of edge cases in the question but I managed to identify them and performed a dry run to the interviewer. The interviewer was satisfied with my approach and moved on to a puzzle question.

Q - There are 3 light bulbs (R,G,B) with 3 switches respectively. Let 000 signify all are off and 111 signify all are on. If more than one bulb are turned on you will see a mixture of those colors. You have to go from 000 to 111 covering all possible colors in the shortest number of moves such that in one move you can toggle only one bulb.

This clearly reminded me of the gray code sequence and I was instantly able to answer it and the interviewer was impressed by it.

I was selected for the next round which was in about 1.5 hrs.

Round 2

This round started initially with discussion about my projects. I explained the tech stack, project structure, the goal of the project, etc. and in the meantime the interviewer had opened the same project on Github and asked me a couple of questions over my react and flutter projects -

1. What does package.json / pubspec.yaml file store.
2. What does package-lock.json / pubspec.lock file store.
3. What is the difference between the two.
4. What is the difference between dependencies and dev-dependencies.
5. How do you send real time notifications if the app is currently in dead state.

I was only able to answer a couple of them and the interviewer was already disappointed. He then moved on to a DSA question .

Q - A database contains the list of all batters and their respective runs scored by them. We have to define a data structure so as to minimize the time complexity of the following operations -

1. Add a batter to the db
2. Remove a batter from the db
3. getRunsScored(String batter)
4. kthHighestRunScorer(int k)

I took around 10 mins but was able to devise a data structure, the interviewer didn’t really respond to my answer and straightaway moved to the next question. The final question was a puzzle question.

Q - Alice and Bob are playing a game where during their turn a player selects any number between 1 to 10 ( both inclusive) and add it to the currentSum. Whenever the currentSum reaches 100 the player with the present turn wins. Alice always starts first, derive a strategy for alice so that she never loses.

I was able to deduce that alice need to reach 89 in order to win, after that i started thinking about multiples and factors and hence couldn’t find the correct approach.

The answer was to recursively solve for alice.

100 —> 89 —> 78 …. —> 12 —> 1.

Felt really bad that i couldn’t solve the puzzle as it was very easy.

The interview ended here and I was informed by the Placement team that I was rejected.