Sign In
Back to Sheets/Sprinklr Master DSA Sheet

Sprinklr Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Sprinklr interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specificsprinklr-prep
0
42
Asteroid Collision
Medium
Longest Univalue Path
Medium
Create Components With Same Value
Hard
Number of Same-End Substrings
Medium
Maximum Subarray Sum After One Operation
Medium
Closest Subsequence Sum
Hard
Count the Number of Powerful Integers
Hard
Next Greater Numerically Balanced Number
Medium
Longest Substring Without Repeating Characters
Medium
Minimum Time to Revert Word to Initial State I
Medium
Choose Edges to Maximize Score in a Tree
Medium
Apply Operations on Array to Maximize Sum of Squares
Hard
Serialize and Deserialize Binary Tree
Hard
Minimum Edge Weight Equilibrium Queries in a Tree
Hard
Apply Bitwise Operations to Make Strings Equal
Medium
Maximize Score After N Operations
Hard
Minimum Time to Revert Word to Initial State II
Hard
Number of Great Partitions
Hard
Maximum Score of Non-overlapping Intervals
Hard
Maximum Sum Circular Subarray
Medium
Trapping Rain Water
Hard
First Missing Positive
Hard
Regular Expression Matching
Hard
House Robber III
Medium
Remove Boxes
Hard
Longest Valid Parentheses
Hard
Frog Jump
Hard
Max Points on a Line
Hard
Isomorphic Strings
Easy
LRU Cache
Medium
Sum of Subarray Minimums
Medium
Subarray Sum Equals K
Medium
Validate Stack Sequences
Medium
Shortest Path with Alternating Colors
Medium
Odd Even Jump
Hard
Maximal Rectangle
Hard
Best Time to Buy and Sell Stock
Easy
Student Attendance Record II
Hard
132 Pattern6 Months
Medium
Find Median from Data Stream
Hard
Sliding Window Maximum
Hard
Cherry Pickup II
Hard