'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Sprinklr interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Sprinklr
4 rounds | 15 Coding problems
Interview preparation journey
Preparation
Duration: 2 months
Topics: Operating System, Networking, Database Management System, Data structures
Tip

I went through all the concepts taught by Coding Ninjas in my course. Apart from that, I practiced 600+ coding interview questions from different coding platforms. Though Data Structure is the base for any tech interview, one must know some other subjects as well like Operating System, Networking, and Database Management System for which I  took help from Coding Ninjaâ€™s notes and from GeeksforGeeks. Along with this stuff, I also read about puzzles on GeeksForGeeks. Overall, Coding Ninjas & Geeks For Geeks have a big hand in making me crack this interview. Just work hard and practice more and more questions based on Data Structures from coding platforms like Codezen etc.

Application process
Where: Campus
Eligibility: Above 8 CGPA
Resume tip

Keep your resume up to date and mention three or four good level projects which will give a good impression to the interviewer .

Interview rounds
01
Round
Easy
Online Coding Test
Duration180 minutes
Interview date27 Jul 2019
Coding problem3

This was MCQ +Coding round. There were 2 coding questions and around 5  MCQâ€™s. Coding Questions were pretty fair and have an appropriate level.

1. MCQ's

Multiple Choice Questions were based on aptitude, time complexity, and Data structures.

2. Overlapping Intervals
Easy
24m average time
0/40

Check if any two intervals overlap among a given set of intervals. An interval is given in form of start and end time. Given a set of intervals, check if any two intervals overlap or not.

Problem approach
• First I gave the interviewer brute force approach by checking each interval starting and ending time with other every interval. Then I gave him sorting solution with complexity O(N log N) in which I sort all intervals according to start time and then compare them in O(n) time.
3.

Let a(n) be a sequence of numbers, which is defined by the recurrence relation a1=1 and a(n+1)/a(n)=2n. The task is to find the value of log2(a(n)) for a given n.

Problem approach
• I  basically use the relation between a(n+1) and a(n) to find a(n). Replace n with n-1, then with n-2 then with n-3 and so on. After this, we have to multiply all these substituted relations. And after multiplication, most of the terms will cancel and we will get a relation between a(n+1) and a1, also substitute the value of a1 from the given statement. After this, we have a(n+1) in f...
View more
02
Round
Easy
Face to Face
Duration20 minutes
Interview date27 Jun 2019
Coding problem3

In this round interviewer gave me three coding questions that I solved properly. Also, the interviewer asked me to write the code for them which I wrote neatly on paper with proper comments.

1. Alien Dictionary
Hard
46m average time
50% success
0/120

Given a sorted dictionary of an alien language, find order of characters in language.

Sample case:

Input words[]= {"caa", "aaa", "aab"};

Output = c a b

Explanation: As the given array is sorted so c comes before a and after that b according to given string.

Problem approach
• I made a graph in between the first mismatched character of every adjacent alphabet pair and applied topological sorting.
2. Implementation: Hashmap
Easy
30m average time
90% success
0/40

Implement the data structure which takes constant time for insertion, deletion and find operations.

Problem approach
• I implemented hashmap using hashing with chaining technique in C++ and interviewer further extended discussion on hashing with chaining.
3. String Transfomation
Moderate
23m average time
0/80

Given a string (STR) of length N, you have to create a new string by performing the following operation:

Take the smallest character from the first 'k' characters of STR, remove it from STR and append it to the new string.

You have to perform this operation until STR is empty.

Problem approach
• Firstly I gave the interviewer a completely brute force approach, and then I gave him max heap solution by implementing it through priority queue.
03
Round
Easy
Face to Face
Duration20 minutes
Interview date27 Jul 2019
Coding problem7

He gave me some puzzles, one coding question, and few subjective questions based on networking and Database Management System. I was able to crack all puzzles but not able to solve that one coding question but gave all solutions to theory questions.

1.

You are blindfolded and 10 coins are placed in front of you on the table. You are allowed to touch the coins, but canâ€™t tell which way up they are by feel. You are told that there are 5 coins head up, and 5 coins tails up but not which ones are which.

Can you make two piles of coins each with the same number of heads up? You can flip the coins any number of times.

Problem approach
• I took examples there and got the logic of the puzzle. Answer will be yes. Make 2 piles with equal number of coins and in total there will be 5 heads and 5 tails. Now, flip all the coins in one of the pile.Now both piles have the same number of heads. Take an example: suppose one pile have H H T T H and another pile have T H T H T. Now flip the pile one, so pile one will become T T H H T, ...
View more
2.

There are 1000 wine bottles. One of the bottles contains poisoned wine. A rat dies after one hour of drinking the poisoned wine. How many minimum rats are needed to figure out which bottle contains poison in hour.

Problem approach

I solved this puzzle using a short example. I took 8 bottles and feed three rats with wine. I fed each rat 4 bottles. Now, suppose three rats have the following wine configuration:

Rat 1 - 3 6 7 8 (0 0 1 0 0 1 1 1)

Rat 2 - 2 5 7 8 (0 1 0 0 1 0 1 1)

Rat 3 - 4 6 5 8 (0 0 0 1 1 1 0 1)

If no rat die then we can say that poison is in bottle 1, if rat 1 dies then we can say th...

View more
3. Water Droplet Mixing
Easy
28m average time
0/40

Consider a pipe of length L. The pipe has N water droplets at N different positions within it. Each water droplet is moving towards the end of the pipe(x=L) at different rates.

When a water droplet mixes with another water droplet, it assumes the speed of the water droplet it is mixing with. Determine the no of droplets that come out of the end of the pipe.

Problem approach
• I gave him a brute force type approach by starting from the second drop and comparing it with the previous one and after checking the condition of speed and time if they can mix or not. Similarly, this was done for each drop. But I canâ€™t come up with an optimal solution which the interviewer wanted. The interviewer wanted a greedy approach by me.
4. What is the purpose of normalization in Database Management System?
Problem approach

I told him about the normalization process starting from definition and gave him an example of normalization. I only remember 2-3 purposes of normalization, which I told to interviewer like to minimize redundancy, to break bigger tables in smaller and form links between them.

5. Concept of ACID in Database Management System.
Problem approach
• I told the interviewer about the ACID property by giving its full form and explaining each and every property through real-life example of ATM transaction.
6. What is VPN ?
Problem approach
• I gave a definition of Virtual private network to the interviewer which allows a secure tunnel to be created across a network. I also gave him an example of dial up connection to the server using VPN.
7. Difference between hub and switch.
Problem approach
• I told him few points which I remembered there like basic definitions of both, layers on which they are working ( hub on physical layer & switch on data link) and mode of transmission used by them.
04
Round
Easy
Face to Face
Duration20 minute
Interview date27 Jul 2019
Coding problem2

The interviewer was very interactive and kind, so he made me comfortable all the time during the interview. In this round, he asked me theory questions based on Red Black tree and detailed discussion on my projects which I mentioned on my resume.

1. Characteristics of red-black tree.
Problem approach

Following are the two characteristics of red-black trees.

1. The nodes in a red-black tree are colored. Each node can be either red or black.

2. When a node is inserted or deleted in a red-black tree. certain rules have to be followed to ensure that the tree remains balanced after the node deletion or insertion.

Explained him through the diagram and all properties of the...

View more
2. Discussion on project.
Problem approach
• I started discussion  by giving information about the features of my projects. Then told him about the tech stack used in the project , and then about the database used. Also told him about the flow of the project through pictorial representation.

• Project Tip - Also do prepare for the most challenging task in your projects as this is the most frequent que...
View more
Start a Discussion
Similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Sprinklr
588 views
SDE - Intern
3 rounds | 8 problems
Interviewed by Sprinklr
2441 views
SDE - Intern
3 rounds | 3 problems
Interviewed by Sprinklr
0 views
SDE - Intern
3 rounds | 7 problems
Interviewed by Sprinklr
1402 views
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
10893 views