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

SDE - Intern

Sprinklr
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: - Dynamic Programming- Sort and Search Algorithms- Graphs - Data Structures ( Priority Queue, stack, sets)- Greedy Algorithms- OOPS - DBMS
Tip
Tip

Tip 1 : Don't hesitate in taking a course from Coding Ninjas and waste time in thinking only to take or not, It is an Investment.
Tip 2 : Regularly Participate in Coding Contests on CodeForces.
Tip 3 : Start practicing on Leetcode and InterviewBit 1 month before your Placement Drive.

Application process
Where: Campus
Eligibility: 5 CGPA above
Resume Tip
Resume tip

Tip 1 : Keep it 1 page and mention only field specific achievements.(Nothing like Captain of Cricket Team in College)
Tip 2 : Mention atleast 1 project or past work experience.

Interview rounds

01
Round
Medium
Video Call
Duration50 minutes
Interview date17 Aug 2020
Coding problem3

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

1. Merge Sort Linked List

Moderate
10m average time
90% success
0/80
Asked in companies
AdobeGoogleSamsung R&D Institute

You are given a Singly Linked List of integers. Sort the Linked List using merge sort.

Merge Sort is a Divide and Conquer algorithm. It divides the input into two halves, calls itself for the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, L, M, R) is a key process that assumes that arr[L..M] and arr[M + 1...R] are sorted and merges the two sorted subarrays into one.

Try solving now

2. Maximum sum path from the leaf to root

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

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

3. System Design Question

List tables involved in Online Apps like Uber.

02
Round
Medium
Video Call
Duration55 Minutes
Interview date17 Aug 2020
Coding problem2

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

1. Technical Question

GIven a file of 1 GB having numbers , Sort the file with 100 MB RAM available.

Simple Discussion Around How Google search suggests if we typed something wrong.
e.g. If we type Cracket.
it will suggest : Did you Mean : Cricket.

2. Add Two Numbers As Linked Lists

Moderate
20m average time
80% success
0/80
Asked in companies
MicrosoftOracleSAP Labs

You are given two non-negative numbers 'num1' and 'num2' represented in the form of linked lists.


The digits in the linked lists are stored in reverse order, i.e. starting from least significant digit (LSD) to the most significant digit (MSD), and each of their nodes contains a single digit.


Calculate the sum of the two numbers and return the head of the sum list.


Example :
Input:
'num1' : 1 -> 2 -> 3 -> NULL
'num2' : 4 -> 5 -> 6 -> NULL

Output: 5 -> 7 -> 9 -> NULL

Explanation: 'num1' represents the number 321 and 'num2' represents 654. Their sum is 975.


Try solving now
03
Round
Medium
HR Round
Duration30 Minutes
Interview date17 Aug 2020
Coding problem1

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

1. Basic HR Questions

What are your expectations from this job?

What motivates you?

Problem approach

Tip 1 : Prepare for this round beforehand.
Tip 2 : Prepare stories (even if fake)
Tip 3 : Speak clearly with HR.

Here's your problem of the day

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

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
4 rounds | 15 problems
Interviewed by Sprinklr
2242 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 8 problems
Interviewed by Sprinklr
2954 views
1 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Sprinklr
0 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 7 problems
Interviewed by Sprinklr
2004 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13918 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
13230 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
9230 views
2 comments
0 upvotes