Sprinklr interview questions
Online test → Technical → Technical → HR·61% entry level
DSA
Showing 35 of 119 reported in this area
Count the number of connected components in an undirected graph.
Design and implement an LRU Cache.
Explain and perform AVL tree rotations.
Serialize and deserialize a binary tree
Count unique paths in a grid with obstacles.
Find the boundary traversal of a binary tree
Multiply two numbers represented as strings.
Find the median of a running stream of numbers.
Implement the Longest Common Substring problem.
Last Moment Before All Ants Fall Out of a Plank
Check whether a given graph is bipartite or not.
Find the kth smallest element from a stream of numbers.
Find the Longest Palindromic Substring in a given string.
Check whether a given graph can be divided into two cliques.
Check if one binary tree is a subtree of another binary tree.
Find the Longest Common Subsequence (LCS) between two strings.
Find the maximum size sub-matrix with all 1s in a binary matrix
Find the number of pairs (x, y) in an array such that x^y > y^x.
Implement insert and search operations in a Trie data structure.
Validate whether a given binary tree is a valid Binary Search Tree
Solve Three displays with minimum total cost.
Design a stack that supports getMin() in O(1) time and O(1) extra space.
Find the left view and bottom view of a binary tree in a single traversal.
Find the nth Ugly Number (numbers whose only prime factors are 2, 3, and 5).
Evaluate complex mathematical expressions under modulus arithmetic efficiently
Manipulate given data following specified steps and print the output efficiently
Find the maximum (or minimum) of all subarrays of size k in an array in O(n) time.
Given a string, find the maximum length of a substring with all unique characters.
Find K pairs with the largest sums from two arrays, with time complexity O(n log n).
Count the number of balanced bracket sequences using n opening and n closing brackets.
Print all permutations of a vector with distinct elements and then with duplicate elements.
Optimize a double loop computing sum of (i XOR j) for i in [A,B] and j in [C,D], modulo 1e9+7.
Find the minimum number of steps required for a knight to reach a target position on a chessboard
Mobile Numeric Keypad Problem: Count possible numbers of given length using a mobile numeric keypad.
Search for an element in a row-wise sorted 2D matrix and analyze time complexity for different cases
CS fundamentals
Showing 12 of 47 reported in this area
Explain Quick Sort and its working.
Implement vector data structure in C++.
Explain AVL trees and how they maintain balance.
What happens when you type a URL into a browser?
Explain OS scheduling algorithms and their applications
Explain B Trees and B+ Trees and differentiate between them.
Explain automation framework architecture and related code snippets
Predict the output of Java I/O code snippets and explain the behavior
Explain various page replacement algorithms used in operating systems.
Explain Virtual Memory and whether it is implemented in operating systems.
Identify performance issues in a given web application by reviewing its code.
Implement a HashMap data structure with insert and find operations using a hash function.
Puzzles
Showing 3 of 7 reported in this area
Prove that the sum of twin primes is divisible by 6
3 bulbs and 3 switches puzzle: determine which switch controls which bulb
Poison and Rat puzzle: Determine which rat is poisoned using the minimum number of tests.
System design
Showing 6 of 7 reported in this area
Design a Chess game/system.
Design a URL shortening service.
How would you approach designing a mobile phone for a user?
Design and code a system to find the top K restaurants near a user's location.
Design and implement a file system supporting creation and deletion of files and folders in C++
Given huge data (>10TB), find all the documents which contain the string "Sachin plays cricket".
Behavioural
Showing 3 of 6 reported in this area
Design test scenarios and test cases for a pen
asked oncePractice this →
Tell me about an incident when you handled pressure and achieved your target.
asked oncePractice this →
Design test scenarios and test cases for the WhatsApp application including API testing
asked oncePractice this →
Aptitude
Showing 1 of 5 reported in this area
A couple has two children, and one of them is a boy. What is the probability that the other child is also a boy?
Showing 60 of 157 questions. Ranked by how often the same question came back across reports.
Practise a Sprinklr-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Sprinklr ask?
Candidate interview reports most often cover DSA (62%) and CS fundamentals (25%).
How many rounds does Sprinklr interview have?
Candidate interview reports show an average of 3.7 rounds per experience, with a typical sequence of Online test → Technical → Technical → HR. Individual interview paths can vary.
Is the Sprinklr interview hard?
Among questions with a reported difficulty, the mix is easy 31%, medium 60%, hard 9%.