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

Product Developer

Sprinklr
upvote
share-icon
5 rounds | 8 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Javascript, React + Redux, Html + CSS, Web Performance, Linear Data Structures
Tip
Tip

Tip 1 : Be Efficient in JS, HTML, CSS with JS polyfills and code knowledge of working of each
Tip 2 : With React, Redux know how it works in the background why it's needed also hands-on implementation
Tip 3 : Web performance is a must with knowledge of webpack, babel etc

Application process
Where: Linkedin
Eligibility: Have a good experience in web development
Resume Tip
Resume tip

Tip 1 : Give clear, crisp matric-based pointers. like You have improved performance of a webpage and its lighthouse score when from X to Y.
Tip 2 : Should have right only those things and technology you know best and go deep into the understanding

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date7 Jul 2020
Coding problem1

1. Stack Implementation Using Array

Easy
20m average time
70% success
0/40
Asked in companies
QualcommNatwest GroupOracle

Stack is a data structure that follows the LIFO (Last in First out) principle. Design and implement a stack to implement the following functions:

1. Push(num): Push the given number in the stack if the stack is not full.

2. Pop: Remove and print the top element from the stack if present, else print -1.

3. Top: Print the top element of the stack if present, else print -1.

4. isEmpty: Print 1 if the stack is empty, else print 0.

5. isFull: Print 1 if the stack is full, else print 0.


You have been given ‘m’ operations which you need to perform in the stack. Your task is to implement all the functions of the stack.


Example:
We perform the following operations on an empty stack which has capacity 2:

When operation 1 1 is performed, we insert 1 in the stack.

When operation 1 2  is performed, we insert 2 in the stack. 

When operation 2 is performed, we remove the top element from the stack and print 2.

When operation 3 is performed, we print the top element of the stack, i.e., 3.

When operation 4 is performed, we print 0 because the stack is not empty.

When operation 5 is performed, we print 0 because the stack is size 1, which is not equal to its capacity.
Problem approach

Created a stack class using array with methods such as push, pop etc

Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date10 Jul 2020
Coding problem2

JS, Html, CSS, JS polyfill round

1. Javascript Question

JS polyfill such create your own Array.map function

2. Function chaining related question

Create Math.add(2).substract(5).multiply(4)

03
Round
Medium
Video Call
Duration60 Minutes
Interview date14 Jul 2020
Coding problem2

Deep JS round

1. Javascript Question

Create polyfill of Promise Class of JS

2. React based Question

Create your own React.useState.

04
Round
Easy
Video Call
Duration90 Minutes
Interview date18 Jul 2020
Coding problem2

1. Build a todo app using react redux

Todo creation with creating your own redux, pub sub knowledge needed

2. How can you improve performance of a webpage?

To improve performance of aaj tak website, what you will do?

05
Round
Easy
Video Call
Duration60 Minutes
Interview date25 Jul 2020
Coding problem1

1. Basic HR question

Detailed discussion on what i did in my last companies.

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
Software Testing Engineer
5 rounds | 4 problems
Interviewed by Sprinklr
2275 views
0 comments
0 upvotes
company logo
SDET
5 rounds | 6 problems
Interviewed by Sprinklr
2609 views
0 comments
0 upvotes
company logo
Product Engineer
3 rounds | 6 problems
Interviewed by Sprinklr
1068 views
0 comments
0 upvotes
company logo
Automation Engineer
5 rounds | 8 problems
Interviewed by Sprinklr
2228 views
0 comments
0 upvotes