SPRINKLR Production Analyst Interview Questions, Process, and Tips

Quantitative reasoning questions probability, permutations combinations, data interpretation and other important topics.

Q1. Introduce yourself ,why do you want to join this particular organization, project related questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test consists of 3 coding questions ranging from medium to high.

Q1. 
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...read more
Ans. 
I solved it using Binary Search Algorithm.
Answered Anonymously
Add your answer

Round duration - 30-40 minutes
Round difficulty - Medium

This was a technical interview first round which was based on Machine Learning, Deep Learning, Data Structures, and other computer science fundamentals.
In Machine Learning, they asked me regarding error functions, loss functions, overfitting, techniques to overcome overfitting, underfitting and techniques to handle missing values in the dataset. The next question was coding one and the question was to find the maximum element in the array in the window of size k.( gave solution starting from bruit force to Optimized one)

Q1. 
Maximum of All Subarrays of Size K
You are provided with an array A containing N integers. Your task is to determine the maximum element in every contiguous subarray of size K as you move from left to rig...read more
Ans. 
1.Create a queue to store k elements.
2.Run a loop and insert till index less than k(window size) in the queue.
3.Then for an index greater than equal to k, check the greater element of the current queue and output it. And then
to slide the window, dequeue the first element of the queue, and enqueue new element of the current index in the
queue.
4.And when the loop completes, check the greater element of the queue outside t
Answered Anonymously
Add your answer

Round duration - 30-40 minutes
Round difficulty - Medium

This was my technical round 2.

Q1. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
1. Initialize distances of all vertices as infinite.
2. Create an empty priority_queue pq. Every item of pq is a pair (weight, vertex). Weight (or distance) is used as the first item of pair as the first item is by default used to compare two pairs
3. Insert source vertex into pq and make its distance as 0.  While either pq doesn't become empty
a) Extract minimum distance vertex from pq. Let the extracted vertex be u...read more
Answered Anonymously
Add your answer

Round duration - 30-40 minutes
Round difficulty - Medium

This was my technical round 3.The interviewer started with very basic maths questions like what is an eigenvalue, eigenvector, the inverse of a matrix, Does inverse exist for the rectangular matrix?
After that, he switched to the coding question
 

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. Array Approach
We will use an array of type Pair<key, value> to implement our LRU Cache where the larger the index is, the more recently the key is used. Means, the 0th index denotes the least recently used pair, and the last index denotes the most recently used pair.
 
The key will be considered as accessed if we try to perform any operation on it. So while performing the get operation on a key, we will do a ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This is a cultural fitment testing round .