Sprinklr Coding Interview Questions: 23 Tagged Problems
23 coding problems tagged Sprinklr — 1 easy · 13 medium · 9 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 23
- By difficulty: 1 easy · 13 medium · 9 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
23 problems the CodeKairo catalogue tags as commonly asked in Sprinklr's coding rounds — 1 easy, 13 medium and 9 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (17), Dynamic Programming (10) and Stack (6). Tagged for Sprinklr and no other company: Edit Distance. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Sprinklr, which CodeKairo is not affiliated with.
Sprinklr study plan by topic
All 23 problems tagged Sprinklr over 2 weeks, about 15 h 25 min of solving, grouped by technique in the order they build on each other — Hash Table, Sliding Window, Prefix Sum and Binary Search and 11 more.
Week 1: Hash Table, Sliding Window, Prefix Sum +4
12 problems on Hash Table, Sliding Window, Prefix Sum, Binary Search, Stack, Queue and Monotonic Stack, easiest first within each topic.
- Isomorphic Strings Easy
- Maximum Points You Can Obtain from Cards Medium
- Maximum Sum of Two Non-Overlapping Subarrays Medium
- Subarray Sum Equals K Medium
- Count Subarrays With Median K Hard
- House Robber IV Medium
- Asteroid Collision Medium
- Validate Stack Sequences Medium
- Trapping Rain Water Hard
- Maximum Sum Circular Subarray Medium
- Number of People Aware of a Secret Medium
- Sum of Subarray Minimums Medium
Week 2: Matrix, Greedy, Ordered Set +5
11 problems on Matrix, Greedy, Ordered Set, Bit Manipulation, Bitmask, Graph, Dynamic Programming and Geometry, easiest first within each topic.
- Cherry Pickup II Hard
- Gas Station Medium
- 132 Pattern Medium
- Odd Even Jump Hard
- Apply Operations on Array to Maximize Sum of Squares Hard
- Maximize Score After N Operations Hard
- Closest Subsequence Sum Hard
- Shortest Path with Alternating Colors Medium
- Edit Distance Medium
- Number of Great Partitions Hard
- Max Points on a Line Hard
All problems tagged Sprinklr
Easy (1)
- Isomorphic Strings String, Hash Table
Medium (13)
- Maximum Sum of Two Non-Overlapping Subarrays Array, Dynamic Programming, Sliding Window
- Shortest Path with Alternating Colors Graph, Breadth-First Search
- Number of People Aware of a Secret Queue, Dynamic Programming, Simulation
- House Robber IV Array, Binary Search, Greedy
- Maximum Points You Can Obtain from Cards Array, Sliding Window, Prefix Sum
- Validate Stack Sequences Array, Stack, Simulation
- 132 Pattern Array, Binary Search, Stack
- Sum of Subarray Minimums Array, Dynamic Programming, Stack
- Maximum Sum Circular Subarray Array, Divide and Conquer, Dynamic Programming
- Edit Distance String, Dynamic Programming
- Gas Station Array, Greedy
- Asteroid Collision Array, Stack, Simulation
- Subarray Sum Equals K Array, Hash Table, Prefix Sum
Hard (9)
- Closest Subsequence Sum Array, Two Pointers, Bitmask
- Count Subarrays With Median K Array, Hash Table, Prefix Sum
- Maximize Score After N Operations Math, Dynamic Programming, Number Theory
- Apply Operations on Array to Maximize Sum of Squares Array, Hash Table, Greedy
- Odd Even Jump Array, Dynamic Programming, Stack
- Cherry Pickup II Array, Dynamic Programming, Matrix
- Number of Great Partitions Array, Dynamic Programming
- Max Points on a Line Hash Table, Math, Geometry
- Trapping Rain Water Array, Two Pointers, Dynamic Programming
Topics Sprinklr asks most
- Arrays 17 problems
- Dynamic Programming 10 problems
- Stack 6 problems
- Hash Table 5 problems
- Prefix Sum 4 problems
- Monotonic Stack 3 problems
- Simulation 3 problems
- Greedy 3 problems
- Strings 2 problems
- Math 2 problems
- Two Pointers 2 problems
- Sliding Window 2 problems