GeeksforGeeks Experience · Apr 2025

Sprinklr Interview Experience for Product Intern

SWE Phone Screen Intern Easy

Interview Experience

In Aug 2023, Sprinklr visited our college for an on-campus intern.Stipend: 2 Lakh per monthRole: Product InternThere are total 4 rounds for the recruitment:

Round 1 Online...

Full Details

In Aug 2023, Sprinklr visited our college for an on-campus intern. Stipend: 2 Lakh per month Role: Product Intern There are total 4 rounds for the recruitment:

Round 1 Online Coding Round There are 3 question (Easy, Above Moderate and Hard) are as follows: No of Components in Undirected Graph (Similar as this ) Find K pairs with largest sum in an array and Required Time Complexity- O(nlogn) You are given a tree with N nodes where each node has an initial value. You will be given a number of queries, each specifying two nodes u and v, and a value x. For each query, you need to add x to all nodes on the path from u to v. After processing all queries, calculate the absolute difference between the initial and the updated values for each node, and sum these differences across all nodes. This is super tough related to Binary Lifting I solved 1st and 3rd completely and 2nd with TLE. Result of

Round 1 I got shortlisted

Round 2 Technical Round 1 Started with the introduction then 1st question is related to Quick sort because of my sorting visualizer project. I answered all the question about this and he seems satisfied. 2nd question : store the multiplication of last 3 maximum element of an array I had explained and coded 3 approaches, first with N^2log(N) then with Nlog(N) then with O(N)... then he moved to another question 3rd question: Multiply the strings To be honest, I got stumbled on this. I explained my first approach then he ask can I optimize it... I couldn't figure out how can I optimize so he said go ahead with your 1st approach again, I got stumbled (I dont know why I got hooked at very general question) I wrote the code but he didn't said to dry run. around after 45 min, Interview get over.

Result Not Qualitied for 2nd Technical Round About: Sprinklr selects only cream layer of students so be prepared and It doesn't care about your CGPA , resume or gender....sprinklr shortlist students on the basis of Online Coding round Tips: Dont get nervous (becuase I got, its my first oncampus interview and I got so nervous that I vomitted one day before the interview)

About This Question

This is a candidate experience report from a sprinklr interview for a swe role (intern level) during the phone screen round reported in 2025.

It covers the following topics: Trees, Strings, Sql, Graph, Sorting, Graphs, Arrays .

Difficulty rating: Easy