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