Open In App

Sprinklr Interview Experience | Set 3 (On Campus for FTE)

Last Updated : 12 Aug, 2017
Improve
Improve
Like Article
Like
Save
Share
Report

Online Test: 720 points
The test was conducted on hackerearth platform, consisted of 2 sections.
Section 1: 120 points.
30 MCQs. Marking scheme: +4 -1
Some questions were subject related OS,CNS,DBMS. Some were from C,Java input output, basic concepts.
Others technical questions related to Trees, Graphs, sorting, etc.

Section 2: 600 points.
4 coding questions. 2 of 100 points, 2 of 200 points.
100 points: The question was similar to this one. https://www.geeksforgeeks.org/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix/
100 points: It was related to Math, modulus arithmetic. There were complicated expressions given to be evaluated, but if solved, they got reduced to a single expression. That was the catch in the problem. Otherwise, the solution would result in TLE.
200 points: Related to binary search.
200 points: Data was given. It had to be manipulated following given steps, and the output to be printed. Brute force did not work, gave result TLE.

Total 40 students were shortlisted for interviews after the online test.

Interview Round-1: Technical: 45-50 minutes
There were two interviewers.
The first interviewer looked at my resume, and asked questions related to my industrial internship.
He asked me about the course projects – Software Engineering project and Database project. Also asked questions about an App I had developed and written in the resume.

The second interviewer asked me about my approach to the coding questions in the online round, even about the ones I was not able to attempt.
Then, questions related to OS. Mainly scheduling and applications.
Then, 1 probability question. A few questions related to trees and sorting.

Interview Round-2: Technical: 45-50 minutes
There were two interviewers.
First I was asked about my industrial internship. Then, a couple of questions related to Java.
The first interviewer asked me the following question:
Given m,n dimensions of a 2D matrix; (i,j) initial co-ordinates; (x,y) final co-ordinates.
What is the probability of being at (x,y) after at most k steps if we start from (i,j) initially?
First, I thought about it and explained my approach. I was then asked to write a pseudo code on paper for the same. I explained the code and answered questions related to complexity of code, improvements.

The second interviewer asked me the following question:
If a user comes to you with a request to design a mobile for him, what will be your approach?
I was asked to explain whatever points I was saying, had to answer all the counter questions.

Interview Round-3: HR round: 25-30 minutes
This was a typical HR interview.
First I was asked to introduce myself. Questions related to my hobbies, my areas of interest.
Why Sprinklr?
Are you planning for further studies?
She told me things about the work environment in the company and the compensation policy.

At the end, total 13 students were selected.


Previous Article
Next Article

Similar Reads

Sprinklr Interview Experience | Set 5 (On campus - FTE for Product Engineer)
Online Coding Test (2 hours): There were 15 MCQs based on Data Structures and Algorithms, JavaScript, c++, Java, Time Complexity Analysis. 3 coding questions were given. 1) You are given a string consisting lowercase letters. You have to find number of substrings in which all characters are different. Constraint: 1 <= length of string N <= 10
4 min read
Sprinklr Interview Experience | On-Campus 2020 for FTE (Internship +Job)
Round one : (Coding test) It was an online coding test conducted on HackerEarth. A test consisting of 3 coding questions. Given two binary strings A and B. In one move you can choose any two numbers from string A and replace any of them with XOR of them and another one with OR of them. Ex: A=0010110. You chose 0 and 1 so, 0 XOR 1=1 and 0 OR 1=1 so,
6 min read
Sprinklr Interview Experience for SDE FTE (On-Campus)
Round-1 (Online Coding Assessment)The first round was an online coding test held in July 2023. It consisted of three relatively hard questions based on Data Structures and Algorithms (DSA). The test was challenging and required a solid understanding of DSA concepts to solve the problems efficiently. Out of approximately 350 students who sat for the
3 min read
Sprinklr Interview Experience | Set 1 (On-Campus at IIT Kanpur)
An online test(2 hours) which has two sections. They asked 16 questions in the first section (20 minutes) which were objective. It consisted of questions from Operating systems, Networks, Java based MCQ(theory+output), C/C++ based questions(theory + output), etc. Second section had 4 coding questions (1 hr 40 minutes). One of those was an avg quest
1 min read
Sprinklr Interview Experience | Set 2 (On-Campus)
Sprinklr On-Campus Interview Experience : Round 1 : (Hackerrank test) 1hr 40 technical and aptitude mcqs , mostly technical from almost all topics(C,java,DBMS,OS,Networks,DS-Algo etc.) questions were of medium standard. Round 2: (Coding test) 1.5hr Consisted of 3 questions. 2 were very easy and one was medium. Q. Don't remember q1 but the logic was
1 min read
Sprinklr Internship Interview Experience (On-Campus)
Round One Coding test of 1.5 Hours: It was an online coding test conducted on HackerRank. A test consisting of 3 coding questions. A medical team wants to send a minimum number of workers for vaccinating people in the city, each worker can vaccinate people in an area whose radius is D, and can start from anywhere, an array is given which tells the
4 min read
Sprinklr Interview Experience For Internship (On-Campus)
Round 1: Coding Round (2 hrs) The first round was the coding round conducted on HackerEarth. There were 40 Multiple Choice Questions based on C, OOPS, OS, DS-Algo and aptitude(around 20 questions). These were basic questions. There were 3 more coding questions :- Question 1 : (50 marks)  It is the simple question. You have to apply level order BFS
3 min read
Sprinklr Interview Experience (On-Campus) 2022
Each and Every Round was eliminatory. Round 1 (Online coding test, Platform: HackerEarth): Total 3 Questions. Those who solved at least 2 Questions out of 3 were shortlisted for interviews. Q1. (Easy: 25 points) : Based on the prefix-suffix sum. I don't remember the Question. But it was very Easy. Almost everyone in my batch solved this Question.Q2
5 min read
Sprinklr Interview Experience | (On Campus for Internship)
Round 1: Online Coding Round (1hr 45 mins on Hackerearth) This round had 5 MCQs with negative marking related to the time complexities and popular programming algorithms and 3 Coding Questions - Ques 1 (75 Points): You are given an integer N (1<=N<=10^18) the number of nodes in a complete binary tree where node i had 2*i and 2*i+1 as its chil
3 min read
Sprinklr Interview Experience | (On Campus for Internship)
Round One : It was an online coding test conducted on HackerEarth. A test consisting of 3 coding questions. given an integer matrix(m) of the NxM dimension.In one move you can go from position (i,j) to eighter (i+m[i][j] , j) or (i,j+m[i][j]). Initially, you are on at (1,1) and you wanted to reach (N, M). So, you have to print a minimum number of m
6 min read
Practice Tags :