SPRINKLR 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

4 question were asked

Competitive programming

Q1. Puzzles as well
Add your answer

Q1. Basic HR stuff here
Add your answer

Q1. KPI on last experience
Ans. 
My KPI on last experience was to increase customer satisfaction by 10% within 6 months.
• My KPI was to improve customer retention rate by 15%

• I was responsible for increasing revenue by 20% through upselling and cross-selling

• My KPI was to reduce customer complaints by 30% within 3 months
Answered by AI
Add your answer
Q2. Case study on Brand safety
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. 
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
• Assign subjects contiguously to minimize maximum workload

• Determine the minimum possible time required for the most loaded friend

• Example: N=4, K=2, subjects={50, 100, 300, 400} -> Output: 400
Answered by AI
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. 
Find the maximum element in every contiguous subarray of size K as you move from left to right through the array.
• Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

• Pop elements from the deque that are out of the current window.

• Keep track of the maximum element in each window and output the results.
Answered by AI
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. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Consider all 4 possible directions to move from a cell: up, down, left, right.
Answered by AI
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. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
• Implement a doubly linked list to keep track of the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access and updates.

• When capacity is reached, evict the least recently used item before inserting a new item.

• Update the order of keys in the linked list whenever a k
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This is a cultural fitment testing round .