SPRINKLR Software Development Engineer Interview Questions and Answers

2-3 coding questions based on DSA

It was a basic SHL test

Q1. Easy DSA and java related questions
Add your answer

Q1. Typical HR round questions about career prospects
Add your answer

Q1. Write a program to reverse the string
Ans. 
Program to reverse a string using array of characters
• Create an array of characters from the input string

• Iterate through the array in reverse order and append each character to a new string

• Return the reversed string
Answered by AI
Add your answer

3 coding question in 1:30 hr
2 medium + 1 hard
1- greedy
2- binary search, prefix sum
3- dp (too hard)

Q1. Low level design type question
Add your answer

Q1. Hiring manager round. Asked project related questions plus basic hr questions
Add your answer

Verbal ,reasoning,quant

Easy to medium dsa question , and easy sql query

Q1. Project question , leetcode medium level dsa questions
Add your answer

Q1. About company and role
Add your answer

Hacker Rank questions
Time ! hour

Q1. 1)grouping of array 2)Recursion 3)creating matrix
Add your answer
Q2. Basics on oops concept
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It starts with a brief introduction and then the interviewer move to coding questions

Q1. 
Pascal's Triangle Problem Statement
You are provided with an integer N. The objective is to return a 2-dimensional list representing Pascal’s triangle up to row N.
A Pascal's triangle is a triangular arr...read more
Ans. Recursive Solution
The idea is to use recursion to get the value of the coefficients we will create a helper function CALPASCAL which will take row and entry as its input parameters and we call this function in the main function of PRINTPASCAL.
• Inside the function CALPASCAL if the row is 0 or the entry is equal to row then we will just return 1.
• Else we will return the sum of adjacent previous row value that is CALPASCAL(...read more
Answered Anonymously
Add your answer
Q2. 
Set Matrix Zeros Problem Statement
Given an N x M integer matrix, if an element is 0, set its entire row and column to 0's, and return the matrix. Specifically, if a cell has a value 0 (i.e., matrix[i][j]...read more
Ans. Brute-Force Approach
The basic idea is to maintain another boolean matrix ‘isZero’ which stores whether our resultant matrix should contain a zero at a particular index or not. We can traverse every element of our original matrix. If the element is 0, then we traverse the complete row and complete column of that particular element and set isZero values accordingly to true for all the elements in that row and column.
&nbs...read more
Answered Anonymously
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Easy

It starts with a brief introduction and then the interviewer move to coding questions. It basically consists of two coding questions
and some general questions like why should we hire you?

Q1. 
K-th Smallest Element in BST
Your task is to find the ‘K-th’ smallest element in a given Binary Search Tree (BST).
Explanation:
A Binary Search Tree is a binary tree in which for each node, all elements...read more
Ans. Recursion In-order
The basic idea is that traversal the whole tree in an inorder manner and adds the node values in an array and at the end return the ‘k-1’th element of the array. Due to BST property, inorder traversal of BST will in a sorted order( ascending ).
 
Code -
• Initialize a global array ‘arr’, which stores the elements of the BST.
• Use an ‘inorder(root)’ recursive function, to add all the child node in ‘arr’
  • F...read more
Answered Anonymously
Add your answer
Q2. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. Brute Force
• One simple naive solution is to try every possible triplet present in the array as a candidate for the pythagorean triplet.
• So, we simply run three nested loops, and pick three integers and check if they follow the property given in the problem statement( i.e for three integers a,b and c a^2 b^2 = c^2).
• If we find any required triplet, we return true. Otherwise, if we can't find any valid triplet, we return fa...read more
Answered Anonymously
Add your answer