Dashboard Problems Companies Topics SQL System Design AI

No account needed. Your solved list, notes and streak are saved in this browser. Export them from Settings.

Companies

Dashboard Problems Companies System Design

Search

Jump to any problem, company or topic

Sprinklr interview questions (all time) · FAANGrind

Sprinklr

ProductGlobal All time

Sprinklr builds a unified customer experience management platform for social media, marketing, service and insights.

Est. 2009 1,001-5,000 employees

Problems: 45
Window: All time
Topics: 6

45 problems

TopicsLinks

1

1.Apply Operations on Array to Maximize Sum of Squares

Hard1 co.

Hard

Bit Manipulation

also at 0 more

2

2.Edit distance

Medium24 co.

Medium

Dynamic Programming

also at 23 more

3

3.Maximum Points You Can Obtain from Cards

Medium19 co.

Medium

also at 18 more

4

4.Maximum Score of Non-overlapping Intervals

Hard1 co.

Hard

Dynamic Programming

also at 0 more

5

5.Longest Univalue Path

Medium2 co.

Medium

also at 1 more

6

6.Closest Subsequence Sum

Hard1 co.

Hard

Dynamic Programming

also at 0 more

7

7.Number of Great Partitions

Hard1 co.

Hard

Dynamic Programming

also at 0 more

8

8.Count the Number of Powerful Integers

Hard1 co.

Hard

Dynamic Programming

also at 0 more

9

9.Regular Expression Matching

Hard18 co.

Hard

Dynamic Programming

also at 17 more

10

10.Shortest Path with Alternating Colors

Medium1 co.

Medium

also at 0 more

11

Medium52 co.

Medium

Hashing Linked List

also at 51 more

12

12.Apply Bitwise Operations to Make Strings Equal

Medium1 co.

Medium

Bit Manipulation

also at 0 more

13

13.Next Greater Numerically Balanced Number

Medium1 co.

Medium

Recursion & Backtracking

also at 0 more

14

14.Trapping Rainwater

Medium48 co.

Medium

also at 47 more

15

15.Create Components With Same Value

Hard1 co.

Hard

General & N-ary Trees

also at 0 more

16

Medium14 co.

Medium

Greedy Algorithms

also at 13 more

17

17.Minimum Time to Revert Word to Initial State I

Medium1 co.

Medium

also at 0 more

18

18.Maximum Rectangles

Hard17 co.

Hard

also at 16 more

19

19.House Robber III

Medium5 co.

Medium

also at 4 more

20

20.First Missing Positive

Hard19 co.

Hard

also at 18 more

21

21.Longest Valid Parentheses

Hard16 co.

Hard

Dynamic Programming

also at 15 more

22

22.Minimum Time to Revert Word to Initial State II

Hard1 co.

Hard

also at 0 more

23

23.Student Attendance Record II

Hard1 co.

Hard

Dynamic Programming

also at 0 more

24

24.Choose Edges to Maximize Score in a Tree

Hard2 co.

Hard

General & N-ary Trees

also at 1 more

25

25.Maximum Subarray Sum After One Operation

Medium1 co.

Medium

Dynamic Programming

also at 0 more

26

26.Print all nodes at a distance of K in BT

Medium18 co.

Medium

also at 17 more

27

27.Maximize Score After N Operations

Hard1 co.

Hard

Recursion & Backtracking

also at 0 more

28

28.Minimum Number of Increments on Subarrays to Form a Target Array

Hard3 co.

Hard

Dynamic Programming

also at 2 more

29

29.Odd Even Jump

Hard1 co.

Hard

Dynamic Programming

also at 0 more

30

30.Sliding Window Maximum

Medium36 co.

Medium

also at 35 more

31

31.Maximum Sum Circular Subarray

Medium5 co.

Medium

Dynamic Programming

also at 4 more

32

Hard8 co.

Hard

Dynamic Programming

also at 7 more

33

33.Minimum Edge Weight Equilibrium Queries in a Tree

Hard1 co.

Hard

General & N-ary Trees

also at 0 more

34

34.Asteroid Collision

Medium31 co.

Medium

Arrays Stack & Queues

also at 30 more

35

35.Isomorphic Strings

Easy15 co.

Easy

also at 14 more

36

Medium3 co.

Medium

also at 2 more

37

37.Number of Same-End Substrings

Medium3 co.

Medium

Strings Hashing

also at 2 more

38

38.Find Median from Data Stream

Medium30 co.

Medium

also at 29 more

39

39.Sum of Subarray Minimums

Medium17 co.

Medium

also at 16 more

40

40.Validate Stack Sequences

Medium1 co.

Medium

also at 0 more

41

41.Remove Boxes

Hard4 co.

Hard

Dynamic Programming

also at 3 more

42

42.Count subarrays with given sum

Medium36 co.

Medium

also at 35 more

43

43.Max Points on a Line

Hard8 co.

Hard

also at 7 more

44

44.Cherry pickup II

Hard5 co.

Hard

Dynamic Programming

also at 4 more

45

45.Maximum Sum of Two Non-Overlapping Subarrays

Medium1 co.

Medium

Dynamic Programming

also at 0 more

Showing 1–45 of 45

Difficulty split

Easy1(2%)
Medium23(51%)
Hard21(47%)

Top topics

Dynamic Programming16
Stack & Queues6
General & N-ary Trees3
Strings3
Arrays3
Hashing3