SPRINKLR Full Stack Engineer Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Hard

Test was conducted on Hackerearth. 
Test consist of 3 questions (1 medium strings related question + 1 hard digit dp question + 1 hard lazy segment tree question)

Q1. 
Next Smallest Palindrome Problem Statement
Given a string representation of a number 'S', determine the smallest palindrome that is strictly greater than this number 'N'.
Example:
Input:
3
2
99
3
123
4
4567
...read more
Ans. Palindromic String
In this method, Before we start let us define what is the right half (or right part) and what is left half (or left part) in the string. There can be two cases based on the length of the string:
 
• Case-1: (Odd length string), consider the string “1234567”, the part of the string “123” is the left part(or left half) and the part “567” is the right part(or right half), and the one left(4) is called t...read more
Answered Anonymously
Add your answer
Q2. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. Brute Force (Time Limit Exceed)
The basic idea is that try each and every possible subarray and find the sum of the current subarray and check if the current sum is divisible by ‘K’. 
 
• To implement this approach we use two nested loops and one ‘COUNT’ variable to store all subarray with sum divisible by ‘K’ and initially ‘COUNT’ is ‘0’.
• Iterate outer loop ‘i’ from ‘0’ to ‘N-1’ for every position of ‘ARR’.
• Add che...read more
Answered Anonymously
Add your answer
Q3. 
Minimum Operations to Equalize Array
Given an integer array ARR of length N where ARR[i] = (2*i + 1), determine the minimum number of operations required to make all the elements of ARR equal. In a single...read more
Ans. Brute Force
• The idea behind this approach is we have to calculate the average of all the elements of the array ‘ARR’ because the sum of all elements of the array always remains constant.
• So calculating the average will help us to virtually divide the elements into two halves around the average i.e left and the right. So calculating the answer for the left half only will be our required answer. It is because in one operat...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Timing : 8:00 am - 9:30 am
The interview took place on google meet. The interviewer gave 1 coding question on google docs and have to write the code on google doc itself.
After 45 minutes a second interviewer came in the same meeting and he also gave a coding question in the same google doc.

Q1. 
Rank from Stream Problem Statement
Given an array of integers ARR and an integer K, determine the rank of the element ARR[K].
Explanation:
The rank of any element in ARR is defined as the number of elem...read more
Ans. Binary Search Tree
The idea is to use the binary search tree.
 
First of all, we will make a binary search tree say ‘BST’ from the given array ‘ARR’ after this we can use ‘BST’ to find the rank of ‘ARR[K]’.
Each node of ‘BST’ will store the data value and size of its left subtree.
 
Here is the complete algorithm:
 
Step 1- Making the ‘BST’ :
 
Let insert(TreeNode* <int> ROOT, int VAL) be a function whi...read more
Answered Anonymously
Add your answer
Q2. 
Edit Distance Problem Statement
Given two strings S and T with lengths N and M respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...read more
Ans. Recursive Approach
• We will write a recursive approach.
• The base case would be if the length of the first string is 0 then we need to add all the characters of the second string to the first string hence return the length of the second string. Similarly, if the length of the second string is 0 return length of the first string.
• Now the recurrence relation is as follows:
  • If the last characters of two strings are not the same...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing : 10:30 am - 11:30 am
The interview took place on google meet. The interviewer gave 1 coding question on google docs and have to write the code on google doc itself.

Q1. 
Smaller Elements Count Problem Statement
Given an array of size N, return a count array such that COUNT[i] equals the number of elements which are smaller than ARR[i] on its right side.
Input:
Input For...read more
Ans. Brute force
The main idea is for every element to count the number of elements less than ARR[i] on its right using a loop.
 
Algorithm:
• Create an ‘ANSWER’ array of size ‘N’ with an initial value 0.
• Run a loop from ‘i’ = 0 to ‘N’. Inside this run another loop from ‘j’ = ‘i+1’ to ‘N’. If  ARR[i] > ARR[j] then increment the ANSWER[i].
• In the end, return the ‘ANSWER’ array.
Space Complexity: O(1)Explanation:
O(1)
&nbs...read more
Answered Anonymously
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Timing : 11:45am - 12:00 pm.
The interview took place on google meet.