Sprinklr LeetCode Questions
39 questions all-time · 1 easy · 17 medium · 21 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Create Components With Same Value Array, Math, Tree, Depth-First Search, Enumeration | Hard | 100 | 0.5% |
| 2 | Minimum Edge Weight Equilibrium Queries in a Tree Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search | Hard | 93 | 0.5% |
| 3 | Number of Great Partitions Array, Dynamic Programming | Hard | 93 | 0.3% |
| 4 | Apply Bitwise Operations to Make Strings Equal String, Bit Manipulation | Medium | 93 | 0.4% |
| 5 | Apply Operations on Array to Maximize Sum of Squares Array, Hash Table, Greedy, Bit Manipulation | Hard | 93 | 0.4% |
| 6 | Next Greater Numerically Balanced Number Hash Table, Math, Backtracking, Counting, Enumeration | Medium | 93 | 0.6% |
| 7 | Count the Number of Powerful Integers Math, String, Dynamic Programming | Hard | 93 | 0.5% |
| 8 | Number of Same-End Substrings Array, Hash Table, String, Counting, Prefix Sum | Medium | 93 | 0.6% |
| 9 | Minimum Time to Revert Word to Initial State II String, Rolling Hash, String Matching, Hash Function | Hard | 93 | 0.4% |
| 10 | Minimum Time to Revert Word to Initial State I String, Rolling Hash, String Matching, Hash Function | Medium | 93 | 0.4% |
| 11 | Closest Subsequence Sum Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmask | Hard | 93 | 0.4% |
| 12 | Maximum Subarray Sum After One Operation Array, Dynamic Programming | Medium | 93 | 0.7% |
| 13 | Maximize Score After N Operations Array, Math, Dynamic Programming, Backtracking, Bit Manipulation, Number Theory, Bitmask | Hard | 93 | 0.6% |
| 14 | Choose Edges to Maximize Score in a Tree Dynamic Programming, Tree, Depth-First Search | Medium | 93 | 0.6% |
| 15 | Maximum Score of Non-overlapping Intervals Array, Binary Search, Dynamic Programming, Sorting | Hard | 93 | 0.3% |
| 16 | Sum of Subarray Minimums Array, Dynamic Programming, Stack, Monotonic Stack | Medium | 76 | 0.4% |
| 17 | Isomorphic Strings Hash Table, String | Easy | 70 | 0.5% |
| 18 | Subarray Sum Equals K Array, Hash Table, Prefix Sum | Medium | 70 | 0.5% |
| 19 | Asteroid Collision Array, Stack, Simulation | Medium | 63 | 0.5% |
| 20 | Cherry Pickup II Array, Dynamic Programming, Matrix | Hard | 63 | 0.7% |
| 21 | Max Points on a Line Array, Hash Table, Math, Geometry | Hard | 53 | 0.3% |
| 22 | First Missing Positive Array, Hash Table | Hard | 53 | 0.4% |
| 23 | Odd Even Jump Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set | Hard | 53 | 0.4% |
| 24 | Regular Expression Matching String, Dynamic Programming, Recursion | Hard | 53 | 0.3% |
| 25 | Student Attendance Record II Dynamic Programming | Hard | 53 | 0.6% |
| 26 | Shortest Path with Alternating Colors Breadth-First Search, Graph Theory | Medium | 53 | 0.5% |
| 27 | Longest Univalue Path Tree, Depth-First Search, Binary Tree | Medium | 53 | 0.4% |
| 28 | Maximum Sum Circular Subarray Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue | Medium | 53 | 0.5% |
| 29 | Maximal Rectangle Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Hard | 53 | 0.6% |
| 30 | Longest Valid Parentheses String, Dynamic Programming, Stack | Hard | 53 | 0.4% |
| 31 | Remove Boxes Array, Dynamic Programming, Memoization | Hard | 53 | 0.5% |
| 32 | Frog Jump Array, Dynamic Programming | Hard | 53 | 0.5% |
| 33 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 53 | 0.5% |
| 34 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 53 | 0.3% |
| 35 | Validate Stack Sequences Array, Stack, Simulation | Medium | 53 | 0.7% |
| 36 | House Robber III Dynamic Programming, Tree, Depth-First Search, Binary Tree | Medium | 53 | 0.6% |
| 37 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 53 | 0.5% |
| 38 | Edit Distance String, Dynamic Programming | Medium | 53 | 0.6% |
| 39 | Maximum Points You Can Obtain from Cards Array, Sliding Window, Prefix Sum | Medium | 53 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.