SPRINKLR Software Developer Intern Interview Questions, Process, and Tips

Q1. Implement hashmaps
Ans. 
Hashmaps are data structures that store key-value pairs for efficient retrieval.
• Hashmaps use a hash function to map keys to indices in an array.

• Collision resolution techniques like chaining or open addressing are used to handle multiple keys hashing to the same index.

• Common operations on hashmaps include insertion, deletion, and lookup of key-value pairs.
Answered by AI
Add your answer

Q1. House robber leetcode
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1.  Kth largest element in the unsorted array
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
...read more
Ans. 
I gave the max-heap based approach, in which I told him to insert every item into the max-heap, and then return the top K. For this, he asked the time Complexity, I answered O(Klog(K*N)). He told me to optimize it further. This time I gave a pointer based approach, i.e., to set a pointer at every category and then check for max among them, then increment count for the pointer of the category in which max was found, and...read more
Answered by CodingNinjas
View 2 more answers
Q2. Maximum sum path from the leaf to root
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the roo...read more
Ans. 
For each node there can be four ways that the max path goes through the node:
1. Node only
2. Max path through Left Child + Node
3. Max path through Right Child + Node
4. Max path through Left Child + Node + Max path through Right Child

The idea is to keep trace of four paths and pick up the max one in the end. An important thing to note is, root of every subtree need to return maximum path sum such that at most one child o...read more
Answered by CodingNinjas
View 2 more answers
Q3. Draw E-R Diagram for Uber.
Ans. 
Tip 1 : Revise ER diagrams and practice them
Tip 2 : List all entities and their relationships involved with the app.
Tip 3 : After drawing tables apply normalisation to reduce redundancy.
Answered by CodingNinjas
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. GIven a file of 1 GB having data in form of digits, sort the file elements with 100 MB RAM available.
Ans. 
I didn't knew the solution so I thought of this as given n arrays having m nos in each array and we need to sort all arrays with space cmplexity of the order O(nlogm) but definitely not O(m*n) due to memory constraints.
So this is a common Priority Queue Problem for which I told the approach.
Answered by CodingNinjas
Add your answer
Q2. Add two numbers given as linked List
Ans. 
I just did school Mathematics Addition and the interviewer seemed pleased with my approach.
Remember the carry value to be included or not at the end of for loop when you traverse both linked list.
e.g. 237+100 = 337 ( no carry )
but 999+1 = 1000 ( include carry )
Answered by CodingNinjas
Add your answer
Q3. How Google Search Works?
Discussion Around How Google search suggests if we typed something wrong.
e.g. If we type Cracket.
It will suggest : Did you Mean : Cricket.
Ans. 
Tip 1 : Discuss your Approach loudly with Interviewer.
Tip 2 : Get help if you get stuck. For these type of problems, there is no preparation. They just check our thought process.
Tip 3 : I gave solution of above problem as : Google figures time spent on page and if it is very less then it thinks it is probably misspelled
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Q1. Why Sprinkler over other companies
Ans. 
Tip 1 : Prepare for this round beforehand.( Don't take it lightly )
Tip 2 : Know about company beforehand like what work they do and how you are eligible candidate for the role they are looking for.
Tip 3 : For Sprinklr vs Amazon type questions stick to company you are applying and tell how you feel this is best opportunity for you.
Answered by CodingNinjas
Add your answer
Q2. Tell one incident when you were not able to cooperate with your team member and how did you work together.
Ans. 
Tip 1 : Prepare for this round beforehand.
Tip 2 : Develop team spirit and have some team work experience ( like SIH)
Tip 3 : HR can try to confuse you but stay calm.
Answered by CodingNinjas
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. Merge Sort Linked List
You are given a Singly Linked List of integers. Sort the Linked List using merge sort.
Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls its...read more
Ans. Merge Sort
We will use the ‘Merge Sort’ algorithm to sort the given linked list. Merge Sort is a Divide and Conquer algorithm. In this algorithm, we will divide the list into two parts, recursively sort the two parts and finally merge them such that the resultant list will be sorted.
 
Algorithm:
 
1. If the list contains only one node, return the head of the list.
2. Else, divide the list into two sublists. For this, we...read more
Answered by CodingNinjas
Add your answer
Q2. Maximum sum path from the leaf to root
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the roo...read more
Ans. Recursive Subproblem
The idea here is that we will do a recursive solution by asking the children of the current node for the max sum path and then choose the path with the max sum. 
 
The approach will be as follows:
1. Get the max sum path for the left subtree.
2. Get the max sum path for the right subtree.
3. Select the one with the max sum from both and insert current node's data into it.
4. Return the updated path.
    
Al...read more
Answered by CodingNinjas
View 1 more answer
Q3. System Design Question
List tables involved in Online Apps like Uber.
Add your answer

Round duration - 55 Minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Q1. Technical Question
GIven a file of 1 GB having numbers , Sort the file with 100 MB RAM available.
Simple Discussion Around How Google search suggests if we typed something wrong.
e.g. If we type Cracket.
it wi...read more
Add your answer
Q2. Add Two Numbers As Linked Lists
You are given two linked lists representing two non-negative numbers. The digits in the linked list are stored in reverse order, i.e. starting from least significant digit (...read more
Ans. Recursion
• A simple approach could be to recursively add the nodes of the linked list while keeping track of the carry generated.
• The idea behind this approach is the same as finding the sum of two numbers manually on a paper, where we start by adding the LSD and move on till the MSD. Also, keeping track of the carry generated in every iteration.
• As the linked lists represent the numbers in reverse order, the LSD occurs at...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Q1. Basic HR Questions
What are your expectations from this job?
What motivates you?
Ans. 
Tip 1 : Prepare for this round beforehand.
Tip 2 : Prepare stories (even if fake)
Tip 3 : Speak clearly with HR.
Answered by CodingNinjas
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

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. 

Q1. MCQ's
Multiple Choice Questions were based on aptitude, time complexity, and Data structures.
Add your answer
Q2. Overlapping Intervals
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 n...read more
Ans. 
• 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.
Answered by CodingNinjas
View 3 more answers
Q3. 
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.
Ans. 
• 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 form of power of 2. Now replace...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 20 minutes
Round difficulty - Easy

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.

Q1. Alien Dictionary
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...read more
Ans. 
• I made a graph in between the first mismatched character of every adjacent alphabet pair and applied topological sorting.
Answered by CodingNinjas
View 3 more answers
Q2. Implementation: Hashmap
Implement the data structure which takes constant time for insertion, deletion and find operations.
Ans. 
• I implemented hashmap using hashing with chaining technique in C++ and interviewer further extended discussion on hashing with chaining.
Answered by CodingNinjas
View 2 more answers
Q3. String Transfomation
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 ...read more
Ans. 
• Firstly I gave the interviewer a completely brute force approach, and then I gave him max heap solution by implementing it through priority queue.
Answered by CodingNinjas
View 3 more answers

Round duration - 20 minutes
Round difficulty - Easy

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.

Q1. 
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 ...read more
Ans. 
• 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, now both the piles will contai
Answered by CodingNinjas
View 1 more answer
Q2. 
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 ...read more
Ans. 
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 that poison is in bottle 3 as it was first bottle to fe...read more
Answered by CodingNinjas
Add your answer
Q3. Water Droplet Mixing
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 wa...read more
Ans. 
• 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.
Answered by CodingNinjas
View 2 more answers
Q4. What is the purpose of normalization in Database Management System?
Ans. 
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.
Answered by CodingNinjas
Add your answer
Q5. Concept of ACID in Database Management System.
Ans. 
• 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.
Answered by CodingNinjas
Add your answer
Q6. What is VPN ?
Ans. 
• 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.
Answered by CodingNinjas
Add your answer
Q7.  Difference between hub and switch.
Ans. 
• 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.
Answered by CodingNinjas
Add your answer

Round duration - 20 minute
Round difficulty - Easy

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.

Q1. Characteristics of red-black tree.
Ans. 
 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 RB tree.
 
Answered by CodingNinjas
View 1 more answer
Q2. Discussion on project.
Ans. 
• 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 question asked by the interviewer.
 
 
Answered by CodingNinjas
Add your answer