DSA Doctor
Verified Company Vault
Sprinklr DSA Interview Questions
39 curated coding interview questions directly asked in Sprinklr technical rounds, sorted by frequency with recency and difficulty diagnostics.
39
Total Questions
1 (3%)
Easy Problems
17 (44%)
Medium Problems
21 (54%)
Hard Problems
🔥 Most Tested Topics:
Arrays (13)Core DSA (11)Strings (8)Trees (3)Dynamic Programming (3)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2440 | Create Components With Same Value | Hard | Graphs | BFS / DFS / Topological Sort | 53.6% | 100.0% | all |
| 2846 | Minimum Edge Weight Equilibrium Queries in a Tree | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 45.9% | 87.5% | all |
| 2518 | Number of Great Partitions | Hard | Dynamic Programming | State Transition | 33.6% | 87.5% | all |
| 2546 | Apply Bitwise Operations to Make Strings Equal | Medium | Strings | Hashing / Sliding Window | 42.7% | 87.5% | all |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | Hard | Arrays | Sorting / Prefix / Scan | 44.6% | 87.5% | all |
| 2048 | Next Greater Numerically Balanced Number | Medium | Stack / Queue | Monotonic Stack / Simulation | 63.1% | 87.5% | all |
| 2999 | Count the Number of Powerful Integers | Hard | Core DSA | Implementation / Reasoning | 46.2% | 87.5% | all |
| 2955 | Number of Same-End Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 61.6% | 87.5% | all |
| 3031 | Minimum Time to Revert Word to Initial State II | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 35.3% | 87.5% | all |
| 3029 | Minimum Time to Revert Word to Initial State I | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 42.5% | 87.5% | all |
| 1755 | Closest Subsequence Sum | Hard | Arrays | Sorting / Prefix / Scan | 43.7% | 87.5% | all |
| 1746 | Maximum Subarray Sum After One Operation | Medium | Arrays | Sorting / Prefix / Scan | 65.2% | 87.5% | all |
| 1799 | Maximize Score After N Operations | Hard | Core DSA | Implementation / Reasoning | 57.9% | 87.5% | all |
| 2378 | Choose Edges to Maximize Score in a Tree | Medium | Trees | DFS / BFS | 56.7% | 87.5% | all |
| 3414 | Maximum Score of Non-overlapping Intervals | Hard | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 31.5% | 87.5% | all |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 75.0% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 75.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | all |
| 1463 | Cherry Pickup II | Hard | Core DSA | Implementation / Reasoning | 72.4% | 62.5% | all |
| 149 | Max Points on a Line | Hard | Core DSA | Implementation / Reasoning | 30.7% | 50.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 50.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | all |
| 975 | Odd Even Jump | Hard | Greedy | Greedy | 41.2% | 50.0% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 50.0% | all |
| 552 | Student Attendance Record II | Hard | Core DSA | Implementation / Reasoning | 56.6% | 50.0% | all |
| 1129 | Shortest Path with Alternating Colors | Medium | Core DSA | Implementation / Reasoning | 48.0% | 50.0% | all |
| 687 | Longest Univalue Path | Medium | Core DSA | Implementation / Reasoning | 43.9% | 50.0% | all |
| 918 | Maximum Sum Circular Subarray | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 50.0% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 50.0% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 50.0% | all |
| 546 | Remove Boxes | Hard | Core DSA | Implementation / Reasoning | 49.4% | 50.0% | all |
| 403 | Frog Jump | Hard | Greedy | Greedy | 47.3% | 50.0% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | all |
| 456 | 132 Pattern | Medium | Strings | Hashing / Sliding Window | 34.8% | 50.0% | all |
| 946 | Validate Stack Sequences | Medium | Strings; Stack / Queue | Hashing / Sliding Window; Monotonic Stack / Simulation | 70.4% | 50.0% | all |
| 337 | House Robber III | Medium | Dynamic Programming | State Transition | 55.9% | 50.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 50.0% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 50.0% | all |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 50.0% | all |
