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. 
The task is to find the smallest palindrome greater than a given number.
• Iterate from the middle of the number and mirror the left side to form the palindrome.

• Handle cases where the number is already a palindrome or has all 9s.

• Consider odd and even length numbers separately.

• Convert the string to integer for comparison and manipulation.
Answered by AI
View 1 more 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. 
Count the number of subarrays in an array whose sum is divisible by a given integer K.
• Iterate through the array and keep track of the running sum modulo K.

• Use a hashmap to store the frequency of remainders.

• For each prefix sum, check how many previous prefix sums have the same remainder.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
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. 
The minimum number of operations required to make all elements of the given array equal.
• The array is generated based on the formula ARR[i] = (2*i + 1).

• To equalize the array, increment one element and decrement another in each operation.

• The number of operations needed is equal to the difference between the maximum and minimum elements in the array.
Answered by AI
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. 
The task is to determine the rank of a specific element in an array based on the number of smaller elements before it.
• Iterate through the array up to index K and count the number of elements smaller than ARR[K].

• Return the count as the rank of ARR[K].

• Handle multiple test cases by repeating the process for each case.
Answered by AI
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. 
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the edit distances between substrings of the two input strings.

• Fill up the array based on the minimum of three possible operations: insert, delete, or replace.

• Return the value at the bottom right
Answered by AI
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. 
Return an array where each element represents the count of smaller elements on its right side in the given array.
• Iterate through the array from right to left and maintain a sorted list of elements encountered so far.

• For each element, find its index in the sorted list to determine the count of smaller elements on its right side.

• Use binary search or segment trees for efficient searching and updating of the sorted list.
Answered by AI
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

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