Sprinklr interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Sprinklr
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 5 Months
Topics: Data Structures, Algorithms, OOPs, DBMS, SQL, Web Development
Tip
Tip

Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions
Tip 2 : Competitive Programming is a bonus and not a necessity, rather focus on core DSA based problems before trying CP. Do not pursue CP if you do not like it. Devote that extra time to core CS subjects and aptitude preparation.
Tip 3 : Projects play an important role too, do no ignore them. Try to get your hands dirty with a little bit of every field i.e., frontend, backend, and database.

Application process
Where: Campus
Eligibility: Above 7.5 CGPA in college
Resume Tip
Resume tip

Tip 1 : Try to make a single-page resume. Highlight skills, projects, and work experience more than CGPA. Ensure proper spacing and font to maintain professionalism.
Tip 2 : Does not lie on a resume. Everything written on your resume must be known by you in and out.

Interview rounds

01
Round
Easy
Video Call
Duration45 Minutes
Interview date10 Mar 2022
Coding problem2

1. Next smaller Palindrome

Easy
10m average time
85% success
0/40
Asked in companies
Deutsche BankAmazonSprinklr

You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a palindrome.

Note:
1. A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as madam, racecar, 1234321, etc.
2. The numerical value of the given string S will be greater than 0.
3. A single-digit number is also considered a palindrome.
4. The answer number should not contain any leading zeros, except for the case when the answer is 0.
5. Note that the length of the string is nothing but the number of digits in N.
Try solving now

2. Maximum sum path from the leaf to root

Easy
10m average time
90% success
0/40
Asked in companies
OYOSprinklrSamsung

You are given a binary tree of 'N' nodes.

Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the root to leaf paths.

For Example:

sample tree

All the possible root to leaf paths are:
3, 4, -2, 4 with sum 9
5, 3, 4 with sum 12
6, 3, 4 with sum 13
Here, the maximum sum is 13. Thus, the output path will be 6, 3, 4.

Note:

There will be only 1 path with max sum.
Try solving now
02
Round
Easy
Video Call
Duration45 Minutes
Interview date10 Mar 2022
Coding problem3

1. Quick Sort on Linked List

Moderate
35m average time
65% success
0/80
Asked in companies
SprinklrDatametica Solutions Private Limited

You are given a Singly Linked List of integers. Sort the Linked List using Quick Sort Algorithm.

Quick Sort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot such that the elements before the pivot are less than the pivot and all the elements greater than or equal to the pivot come after the pivot.

Try solving now

2. Technical Question

How Google Search Works?

Problem approach

Tip 1 : Discuss your Approach loudly with Interviewer.
Tip 2 : Get help if you get stuck. For these type of problems, there is no preparation. They just check our thought process.
Tip 3 : I gave solution of above problem as : Google figures time spent on page and if it is very less then it thinks it is probably misspelled

3. Kth Smallest and Largest Element of Array

Easy
15m average time
70% success
0/40
Asked in companies
HSBCSalesforceSprinklr

You are given an array ‘Arr’ consisting of ‘N’ distinct integers and a positive integer ‘K’. Find out Kth smallest and Kth largest element of the array. It is guaranteed that K is not greater than the size of the array.

Example:

Let ‘N’ = 4,  ‘Arr’ be [1, 2, 5, 4] and ‘K’ = 3.  
then the elements of this array in ascending order is [1, 2, 4, 5].  Clearly, the 3rd smallest and largest element of this array is 4 and 2 respectively.
Try solving now
03
Round
Medium
HR Round
Duration45 minutes
Interview date10 Mar 2022
Coding problem2

1. Basic HR Question

Why Sprinkler over other companies

Problem approach

Tip 1 : Prepare for this round beforehand.( Don't take it lightly )
Tip 2 : Know about company beforehand like what work they do and how you are eligible candidate for the role they are looking for.
Tip 3 : For Sprinklr vs Amazon type questions stick to company you are applying and tell how you feel this is best opportunity for you.

2. Basic HR Question

Tell one incident when you were not able to cooperate with your team member and how did you work together.

Problem approach

Tip 1 : Prepare for this round beforehand.
Tip 2 : Develop team spirit and have some team work experience ( like SIH)
Tip 3 : HR can try to confuse you but stay calm.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
4 rounds | 15 problems
Interviewed by Sprinklr
2529 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Sprinklr
1153 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 8 problems
Interviewed by Sprinklr
3310 views
1 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Sprinklr
0 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
15480 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
15338 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
10142 views
2 comments
0 upvotes